Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long n,m,a[2005][2005],s[2005][2005];
- long long posi(long long i,long long j)
- {
- return i+j-1;
- }
- long long posj(long long i,long long j)
- {
- return n-i+j;
- }
- long long suma(long long ii,long long jj,long long ii2,long long jj2)
- {
- long long i=posi(ii,jj),j=posj(ii,jj),i2=posi(ii2,jj2),j2=posj(ii2,jj2);
- return s[i2][j2]-s[i-1][j2]-s[i2][j-1]+s[i-1][j-1];
- }
- int main()
- {
- cin>>n>>m;
- for(long long i=1;i<=n;++i)
- for(long long j=1;j<=m;++j)
- {
- long long x;
- cin>>x;
- a[posi(i,j)][posj(i,j)]=x;
- }
- for(long long i=1;i<=n+m-1;++i)
- for(long long j=1;j<=m+n-1;++j)
- s[i][j]=s[i-1][j]+s[i][j-1]+a[i][j]-s[i-1][j-1];
- long long mx(-1),ri(-1),rj(-1);
- for(long long i=1;i<=n;++i)
- for(long long j=1;j<=m;++j)
- {
- long long dst(min({i,j,n-i+1,m-j+1}));
- long long sm(suma(i,j-dst+1,i,j+dst-1));
- if(sm>mx)
- mx=sm,ri=i,rj=j;
- }
- cout<<ri<<' '<<rj;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment