代码如下

#include<iostream>
using namespace std;
int a[350][350];
long long s[350][350];
int d,n,ansx,ansy;

int main(){
    cin >> d>>n;
    for(int i = 1;i <= n;i++){
        int x,y,k;
        cin >>x>>y>>k;
        a[x+20][y+20]+=k;
    }
    for(int i = 1;i <=200;i++){
        for(int j = 1;j <=200;j++){
            s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
        }

    }
    int ans = 0;
    for(int i = 0;i <=128;i++){
        for(int j = 0;j <=128;j++){
            int tmp = s[i+2*d][j+2*d]+s[i-1][j-1]-s[i+2*d][j-1]-s[i-1][j+2*d];
            ans = max(ans,tmp);
        }
    }  
    int ans1=0;  
    for(int i = 0;i <=128+2*d;i++){
        for(int j = 0;j <=128+2*d;j++){
            int tmp = s[i+2*d][j+2*d]+s[i-1][j-1]-s[i+2*d][j-1]-s[i-1][j+2*d];
            if(tmp>=ans){ans1++;}
        }
    }
    cout << ans1<< " "<<ans<<endl;
}