BZOJ1218 激光炸弹

二维区间求和乱搞

#include<cstdio>
using namespace std;
inline int Max(int a,int b)
{return a>b?a:b;}
inline int Min(int a,int b)
{return a<b?a:b;}
int arr[5010][5010],n,a,x,y,r,ans,maxnx,maxny;
int getsum(int x1,int y1,int x2,int y2)
{
	return arr[x2][y2]-arr[x1-1][y2]-arr[x2][y1-1]+arr[x1-1][y1-1];
}
int main()
{
	scanf("%d%d",&n,&r);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d%d%d",&x,&y,&a);
		x++,y++;
		arr[x][y] += a;
		if(x > maxnx) maxnx = x;
		if(y > maxny) maxny = y;
	}
	for(int i = 1; i <= maxnx; i++)
		for(int j = 1; j <= maxny; j++)
		{
			arr[i][j] += arr[i-1][j];
			arr[i][j] += arr[i][j-1];
			arr[i][j] -= arr[i-1][j-1];
		}
	for(int i = 1; i <= maxnx; i++)
		for(int j = 1; j <= maxny; j++)
			ans = Max(ans,getsum(i,j,Min(maxnx,i+r-1),Min(maxny,j+r-1)));
	printf("%d\n",ans);
}