Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long int ll;
- int main()
- {
- int t,d,n,i,j,k1,x,y,p,ax1,ax2,ay1,ay2,k2;
- cin>>t;
- cout<<"a"<<endl;
- for(i=1;i<=t;i++)
- {
- cin>>d;
- cin>>n;
- int a[1026][1026]={0};
- for(j=0;j<n;j++)
- {
- cin>>x>>y>>p;
- ax1=x-d;
- ax2=x+d;
- ay1=y-d;
- ay2=y+d;
- if(ax1<0)
- ax1=0;
- if(ay1<0)
- ay1=0;
- if(ax2>1024)
- ax2=1024;
- if(ay2>1024)
- ay2=1024;
- for(k1=ax1;k1<=ax2;k1++)
- {
- for(k2=ay1;k2<=ay2;k2++)
- {
- a[k1][k2]=+p;
- }
- }
- }
- int max1=-1,in1,in2;
- for(j=0;j<1025;j++)
- {
- for(k1=0;k1<1025;k1++)
- {
- if(a[j][k1]>max1)
- {
- max1=a[j][k1];
- in1=j;
- in2=k1;
- }
- }
- }
- cout<<in1<<" "<<in2<<" "<<max1<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement