[luoguP2038] 无线网络发射器选址（模拟）

传送门

又是个模拟水题，考虑边界就好，连long long都不用开。

——代码

#include <cstdio>
#include <iostream>

int n, d, ans, max;
int a[201][201];

inline int read()
{
int x = 0, f = 1;
char ch = getchar();
for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -1;
for(; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
return x * f;
}

int main()
{
int i, j, x, y, sum;
d = read();
n = read();
for(i = 1; i <= n; i++)
{
x = read();
y = read();
a[x][y] = read();
}
for(i = 0; i <= 128; i++)
for(j = 0; j <= 128; j++)
{
sum = 0;
for(x = i - d; x <= i + d; x++)
for(y = j - d; y <= j + d; y++)
if(x >= 0 && x <= 128 && y >= 0 && y <= 128)
sum += a[x][y];
if(sum > max)
{
max = sum;
ans = 1;
}
else if(sum == max) ans++;
}
printf("%d %d\n", ans, max);
return 0;
}