NOIP2014提高组第二试题解

第一题 wireless 枚举即可，如果数据变大可用部分和优化

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
const int maxn = 600;
int d, n,w[maxn][maxn],x,y,z;
int cnt = 0, ans = 0;
int get(int x, int y)
{
	int sum = 0;
	for(int i = x-d; i <= x+d; ++i)
		for(int j = y-d; j <= y+d; ++j)
            if (i >=0 && j >=0)
			   sum += w[i][j];
	return sum;
}
int main() {
	freopen("wireless.in", "r", stdin);
	freopen("wireless.out", "w", stdout);
	scanf("%d%d", &d, &n);
	for(int i = 1; i <= n; i++){
		cin>>x>>y>>z;
		w[x][y] = z;
	}
	for(int i = 0; i <= 128; i++)
        for(int j = 0; j <= 128; j++) {
			int x = get(i, j);
			if(x > ans) {
				ans = x;