NOIP 2014 Day2 T1 无线网络发射器

#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<vector>
#include<deque>
#include<stack>
using namespace std;
int f[][],a[][],d,n,x[],y[],s[],cnt = ,maxn;
int main(){
    freopen("wireless.in","r",stdin);
    freopen("wireless.out","w",stdout);
    scanf("%d%d",&d,&n);
    for(int i = ;i < n;i++)
       scanf("%d%d%d",&x[i],&y[i],&s[i]);
    for(int i = ;i < ;i++)
       for(int j = ;j < ;j++)
          for(int k = ;k < n;k++)
             if(x[k]>=i-d&&x[k]<=i+d&&y[k]>=j-d&&y[k]<=j+d)
                f[i][j] += s[k];
    for(int i = ;i < ;i++)
       for(int j = ;j < ;j++)
          maxn = max(maxn,f[i][j]);
    for(int i = ;i < ;i++)
       for(int j = ;j < ;j++)
          if(f[i][j]==maxn)
             cnt++;
    printf("%d %d",cnt,maxn);
    return ;
}