问题标题: 酷町堂：点击此处查看全文

1803垃圾BOOM

怎么优化

超时80分

#include <iostream>
using namespace std;
int d, n, ti, ans;
int a[1111][1111];
int b[1111][1111];
int maxx, minx = 11111111, maxy, miny = 11111111;
int sum(int x, int y) {
    int cnt = 0;
    for (int i = x - d; i <= x + d; i ++) {
        for (int j = y - d; j <= y + d; j ++) {
            cnt += a[i][j];
        }
    }
    return cnt;
}
void flag(int x, int y) {
    for (int i = x - d; i <= x + d; i ++) {
        for (int j = y - d; j <= y + d; j ++) {
            b[i][j] = 1;
        }
    }
}
int main() {
    cin >> d >> n;
    for (int i = 1; i <= n; i ++) {
        int x, y, z;
        cin >> x >> y >> z;
        a[x][y] = z;
        flag(x, y);
        maxx = max(maxx, x);
        maxy = max(maxy, y);
        minx = min(minx, x);
        miny = min(miny, y);
    }
    for (int i = max(minx - d, 0 + d); i <= min(maxx + d, 1024 - d); i ++) {
        for (int j = max(miny - d, 0 + d); j <= min(maxx + d, 1024 - d); j ++) {
            if (b[i][j] == 0) {
                continue;
            }
            int x = sum(i, j);
            if (x > ans) {
                ans = x;
                ti = 1;
            } else if (x == ans) {
                ti ++;
            } 
        }
    }
    cout << ti << " " << ans;
    return 0;
}