不知为何不过样例；
by 正式AFO @ 2018-10-02 13:10:36
断点调试
by 业余门槛 @ 2018-10-02 13:23:33
怎么做呢？
by 正式AFO @ 2018-10-02 13:39:24
@[paul2005](/space/show?uid=95333)
by 正式AFO @ 2018-10-02 13:39:30
```cpp
#include<iostream>
using namespace std;
int d, n;
int a, b, k;
int sum, times, i, j;
int x1, y1, x2, y2, cc;
int maap[500][500], mabp[500][500];
int main(){
cin >> d >> n;
for(i = 1; i <= n; i++){
cin >> a >> b >> k;
mabp[a][b] = k;
}
for( i = 0; i <= 128; i++ ){
for( j = 0; j <= 128; j++){
x1 = (i - 1 < 0) ? 0 : i - 1;
y1 = (j - 1 < 0) ? 0 : j - 1;
maap[i][j] = maap[x1][j] + maap[i][y1] + mabp[i][j] - maap[x1][y1];
}
}
for(i = 0; i <= 128; i++){
for(j = 0; j <= 128; j++){
x1 = (i - d - 1 < 0) ? 0 : i - d - 1;
y1 = (j - d - 1 < 0) ? 0 : j - d - 1;
x2 = (i + d > 128) ? 128 : i + d;
y2 = (j + d > 128) ? 128 : j + d;
cc = maap[x2][y2] - maap[x1][y2] - maap[x2][y1] + maap[x1][y1];
if(cc == sum)
times++;
if(cc > sum){
sum = cc;
times = 1;
}
}
}
cout << times << " " << sum;
return 0;
}
```
by 正式AFO @ 2018-10-02 15:03:30
挖了3个点
by 正式AFO @ 2018-10-02 15:03:52