AcWing 99. 激光炸弹
原题链接
简单
作者:
RealDish
,
2020-09-19 13:43:52
,
所有人可见
,
阅读 411
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 5050;
int f[N][N];
int main(){
memset(f, 0,sizeof(f));
int N , R;
cin >> N >> R;
int n = R , m = R;
for(int i = 0 ,x, y,w;i < N ;i++){
cin >> x >> y >> w;
x++, y++;
n = max(n ,x);
m = max(m ,y);
f[x][y] += w;
}
for(int i = 1; i <= n;i++){
for(int j = 1; j <= m;j++){
f[i][j] += f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1];
}
}
int ans = 0;
for(int i = R ;i <= n;i ++){
for(int j = R ;j <= m ;j++){
ans = max(ans, f[i][j] - f[i - R][j] - f[i][j - R] + f[i - R][j - R]);
}
}
cout << ans << endl;
return 0;
}
请问最后的注释便于处理边长为奇数是什么意思?