思路:
暴力
C o d e Code Code:
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int d,n,x,y,z;
int a[1001][1001];
int main ()
{
memset(a,0,sizeof(a));
scanf ("%d%d", &d, &n);
for (int i = 1; i <= n; ++i)
{
scanf("%d%d%d",&x,&y,&z);
a[x][y] += z;
}
int fas = 0,fgs = 0;
for (int i = 0; i < 129; ++i)
for (int j = 0; j < 129; ++j)
{
int sum = 0,maxn = max (0, i - d),minn = min (128, i + d),maxx = max (0, j - d),minx = min(128, j + d);
for (int k = maxn; k <= minn; ++k)
for (int l =maxx; l <= minx; ++l)
sum += a[k][l];
if (sum > fas) {fas = sum, fgs = 1;}
else if (sum == fas) fgs++;
}
printf("%d %d",fgs,fas);
return 0;
}