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

传送门

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

——代码

 #include <cstdio>
 #include <iostream>
 
 int n, d, ans, max;
 int a[][];
 
 inline int read()
 {
     int x = , f = ;
     char ch = getchar();
     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;
     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';
     return x * f;
 }
 
 int main()
 {
     int i, j, x, y, sum;
     d = read();
     n = read();
     for(i = ; i <= n; i++)
     {
         x = read();
         y = read();
         a[x][y] = read();
     }
     for(i = ; i <= ; i++)
         for(j = ; j <= ; j++)
         {
             sum = ;
             for(x = i - d; x <= i + d; x++)
                 for(y = j - d; y <= j + d; y++)
                     if(x >=  && x <=  && y >=  && y <= )
                         sum += a[x][y];
             if(sum > max)
             {
                 max = sum;
                 ans = ;
             }
             else if(sum == max) ans++;
         }
     printf("%d %d\n", ans, max);
     return ;
 }