C++14(g++5.4) 解法, 执行用时: 20ms, 内存消耗: 520K, 提交时间: 2019-11-30 22:48:22

#include<iostream>
using namespace std;
const int N=130;
int d,n,x[N],y[N],g[N][N],ans[N][N],k,ma;
int main(){
    cin>>d>>n;
    for(int i=1,a,b,c;i<=n;i++)
        cin>>a>>b>>c,x[i]=a,y[i]=b,g[a][b]=c;
    for(int i=0;i<=128;i++)
        for(int j=0;j<=128;j++){
            for(int x1=max(i-d,0);x1<=min(i+d,128);x1++)
                for(int y1=max(j-d,0);y1<=min(j+d,128);y1++)
                    ans[i][j]+=g[x1][y1];
            if(ans[i][j]>ma)ma=ans[i][j],k=0;
            if(ans[i][j]==ma)k++;
            }
    cout<<k<<' '<<ma;
}

Python3(3.5.2) 解法, 执行用时: 113ms, 内存消耗: 3556K, 提交时间: 2019-12-21 10:38:00

#! /usr/bin/env python
# -*- coding: utf-8 -*-


def countk(x, y):
    out = 0
    for i in dots:
        if abs(x-i[0]) <= d and abs(y-i[1]) <= d:
            out += i[2]
    return out


d = int(input())
n = int(input())
dots = []
for i in range(n):
    dots.append(list(map(int, input().split())))
m = 0
q = 0
for i in range(129):
    for j in range(129):
        t = countk(i, j)
        if t > m:
            m = t
            q = 1
        elif t == m:
            q += 1
print(q, m)

C++(clang++ 11.0.1) 解法, 执行用时: 7ms, 内存消耗: 464K, 提交时间: 2022-11-25 07:48:06

#include<bits/stdc++.h>
using namespace std;
int d,n,l[200][200],li,ans,sum,x,y,maxm;
int main(){
	cin>>d>>n;
	for(int i=1;i<=n;++i)scanf("%d%d",&x,&y),cin>>l[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)li+=l[m][k];
		if(li==ans)sum++;
		else if(li>ans)sum=1;
		ans=max(li,ans),li=0;
	}cout<<sum<<" "<<ans;
}