Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int mx;
- int main()
- {
- int n,m;
- scanf("%d%d",&n,&m);
- vector<bool> a[n];
- vector<int> dp[n];
- for(int i=0;i<n;i++){
- for(int j=1;j<=m;j++){
- int x;
- scanf("%d",&x);
- if(x==1) a[i].push_back(true);
- else a[i].push_back(false);
- }
- }
- for(int i=0;i<n;i++){
- if(a[i][0]) dp[i].push_back(1);
- else dp[i].push_back(0);
- mx=max(mx,dp[i][0]);
- }
- for(int j=1;j<m;j++){
- if(a[0][j]) dp[0].push_back(1);
- else dp[0].push_back(0);
- mx=max(mx,dp[0][j]);
- }
- for(int i=1;i<n;i++){
- for(int j=1;j<m;j++){
- if(a[i][j]){
- int ans=1+min(dp[i-1][j],min(dp[i][j-1],dp[i-1][j-1]));
- dp[i].push_back(ans);
- }
- else dp[i].push_back(0);
- mx=max(dp[i][j],mx);
- }
- }
- printf("%d",mx);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement