99. 激光炸弹

https://www.acwing.com/problem/content/description/101/

#include<bits/stdc++.h>
using namespace std;
const int N=5010;
int s[N][N],n,r;
int main(void)
{
    cin>>n>>r;
    r=min(r,5000);
    while(n--)
    {
        int a,b,c; cin>>a>>b>>c;
        s[a+1][b+1]+=c;
    }
    for(int i=1;i<=5000;i++)
        for(int j=1;j<=5000;j++)
            s[i][j]+=s[i-1][j]+s[i][j-1]-s[i-1][j-1];
    int ans=0;
    for(int i=1;i<=5000-r+1;i++)
        for(int j=1;j<=5000-r+1;j++)
            ans=max(ans,s[i+r-1][j+r-1]-s[i-1][j+r-1]-s[i+r-1][j-1]+s[i-1][j-1]);
    cout<<ans;
}