1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
int dp[1001][1001]={0};
int solution(vector<vector<int>> v)
{

    int answer = -999999;
    int i,j;
     if(v.size() == 1 || v[0].size() == 1)
    {
        for(int i = 0; i < v.size(); i++)
        {
            for(int j = 0; j < v[0].size(); j++)
            {
                if(v[i][j] == 1)
                {
                    return 1;
                }
            }
        }
        return 0;
    }
     for(i=0; i<v.size(); i++)
        for(j=0; j<v[0].size(); j++)
        {
            if(v[i][j]==1)
            {
                dp[i][j]=1;
            }
        }

    for(i=1; i<v.size(); i++){
        for(j=1; j<v[0].size(); j++)
        {
            if(dp[i][j]==1){
            dp[i][j]=min(min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1])+1;
            answer=max(answer,dp[i][j]);
            }
        }
    }
    answer=answer*answer;

    return answer;
}