最后一题WA求调 壶关
查看原帖
最后一题WA求调 壶关
561638
Tanhaoyue2011楼主2025/7/30 10:33
#include<iostream>

using namespace std;

int n,m,c,maxn = -114514;
int sum[1005][1005],a[1005][1005];
int x,y;

int main(){
	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] = a[i][j] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
		}
	}
	for(int i = c; i <= n; i++){
		for(int j = c; j <= m; j++){
			if(sum[i][j] - sum[i - c][j] - sum[i][j - c] + sum[i - c][j - c] > maxn){
				maxn = sum[i][j] - sum[i - c][j] - sum[i][j - c] + sum[i - c][j - c];
				x = i - c + 1;
				y = j - c + 1;
			}
		}
	}
	cout << x << " " << y << endl;
	return 0;
}
2025/7/30 10:33
加载中...