親，來蹭網，免費滴！

點擊即可連接WIFI

#include<bits/stdc++.h>
using namespace std;

int x, y, d, n, maxm, num, ans = 1, cross[170][170];

signed main(){
    cin >> d >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> x >> y;
        cin >> cross[x + 20][y + 20];
    }
    for(int i = 20; i <= 148; i++)
        for(int j = 20; j <= 148; j++){
            for(int m = i - d; m <= i + d; m++)
                for(int k = j - d; k <= j + d; k++)
                    num += cross[m][k];
            if(maxm == num) ans++;
            else if(maxm < num) ans = 1;
            maxm = max(maxm, num);
            num = 0;
        }
    cout << ans << " " << maxm;
    return 0;
}