题目描述
#include<iostream>
using namespace std;
int n, r, a[5002][5002], x, y, v, ans;
int main()
{
cin >> n >> r;
while(n--)
{
cin >> x >> y >> v;
a[x+1][y+1] = v;
}
for(int i = 1; i < 5001; i++)
{
for(int j = 1; j < 5001; j++)
{
a[i][j] = a[i][j] + a[i-1][j] + a[i][j-1] - a[i-1][j-1];
}
}
for(int i = r; i < 5001; i++)
{
for(int j = r; j < 5001; j++)
{
ans = max(ans, a[i][j] - a[i-r][j] - a[i][j-r] + a[i-r][j-r]);
}
}
cout << ans <<endl;
return 0;
}