Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Source #716875:
- #include <bits/stdc++.h>
- using namespace std;
- int main(){
- int n,m,k;
- scanf("%d %d %d",&n,&m,&k);
- int kx[n+1],ky[n+1];
- for(int i=0;i<=n;i++) {
- kx[i]=0;
- ky[i]=0;
- }
- for(int i=0;i<k;i++){
- int x,y,r;
- scanf("%d %d %d",&x,&y,&r);
- int s,f;
- s=y-r;
- f=y+r;
- if(s<0) s=0;
- if(f>n) f=n;
- for(int j=s;j<=f;j++) ky[j]++;
- s=x-r;
- f=x+r;
- if(s<0) s=0;
- if(f>m) f=m;
- for(int j=s;j<=f;j++) kx[j]++;
- }
- int mx=0;
- for(int i=0;i<=n;i++)
- mx=max(mx,ky[i]);
- for(int i=0;i<=m;i++)
- mx=max(kx[i],mx);
- printf("%d",mx);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement