Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("nave.in");
- ofstream fout("nave.out");
- int main()
- {
- long long int n,m,b,A[101][101]={0},lin,col,nr,max=-2000000005,maxi,maxj,S;
- fin>>n>>m>>b;
- for(int i=1;i<=b;i++)
- {
- fin>>lin>>col>>nr;
- A[lin][col]=nr;
- }
- for(int i=1;i<=n;i++)
- for(int j=1;j<=m;j++)
- if(A[i][j]==0)
- {
- S=0;
- lin=i-1;
- col=j+1;
- while(lin>=1 && col>=1 && lin<=n && col<=m)
- {
- S+=A[lin][col];
- lin--;
- col++;
- }
- lin=i-1;
- col=j-1;
- while(lin>=1 && col>=1 && lin<=n && col<=m)
- {
- S+=A[lin][col];
- lin--;
- col--;
- }
- lin=i+1;
- col=j-1;
- while(lin>=1 && col>=1 && lin<=n && col<=m)
- {
- S+=A[lin][col];
- lin++;
- col--;
- }
- lin=i+1;
- col=j+1;
- while(lin>=1 && col>=1 && lin<=n && col<=m)
- {
- S+=A[lin][col];
- lin++;
- col++;
- }
- if(S>=max)
- {
- max=S;
- maxi=i;
- maxj=j;
- }
- }
- fout<<max<<" "<<maxi<<" "<<maxj;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement