Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #define N 1001
- using namespace std;
- int a[N][N],S[N][N];
- int main()
- {
- int n,m;
- ifstream f("terencasa.in");
- f>>n>>m;
- for(int i=1;i<=n;++i)
- for(int j=1;j<=m;++j)
- f>>a[i][j];
- for(int i=1;i<=n;++i)
- S[i][1]=a[i][1],S[1][i]=a[1][i];
- int Max=0,imax=0,jmax=0;
- for(int i=2;i<=n;++i)
- for(int j=2;j<=m;++j)
- if(a[i][j])
- {
- S[i][j]=min(S[i][j-1],min(S[i-1][j],S[i-1][j-1]))+1;
- if(S[i][j]>Max)
- Max=S[i][j],imax=i,jmax=j;
- }
- ofstream g("terencasa.out");
- g<<Max<<'\n';
- g<<imax-Max+1<<' '<<jmax-Max+1<<' '<<imax<<' '<<jmax<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement