全RE求调

#include<bits/stdc++.h> 
using namespace std;
const int maxn = 1e3+5;
long long a[maxn][maxn],sum[maxn][maxn];
int main()
{
	long long n,m,c,xx,yy,Max = -2147483647;
	cin >> n >> m >> c;
	for (int i = 1;i <= n;i++){
		for (int j = 1;j <= m;j++){
            cin >> a[i][j];
			sum[i][j]=sum[i][j-1]+sum[i-1][j]-sum[i-1][j-1]+a[i][j];
		}
	}
	for (int i = 1;i <= n;i++){
		for (int j = 1;j <= n;j++){
			long long s=sum[i][j]-sum[i][j-c]-sum[i-c][j]+sum[i-c][j-c];
			if (s>Max){
				Max=s;
				xx = i-c+1;
				yy = j-c+1;
			}
		}
	}
	cout << xx << ' ' << yy;
	return 0;
}