Algorithms/MaxSquareOfOne.cpp at main · a-pt/Algorithms · GitHub

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
#include <iostream>

using namespace std;
int s[11][11],a[11][11],ma;

void maxso(int n,int m)
{
    int mi;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(s[i][j]==1)
            {
                if(s[i][j-1]<=s[i-1][j] && s[i][j-1]<=s[i-1][j-1])
                mi=s[i][j-1];
                else if(s[i-1][j]<=s[i-1][j-1])
                mi=s[i-1][j];
                else
                mi=s[i-1][j-1];
                s[i][j]=1+mi;
            }
            if(s[i][j]>ma)
                ma=s[i][j];
        }
    }
}

int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            cin>>a[i][j];
            s[i][j]=a[i][j];
        }

    maxso(n,m);
    cout<<ma;
    return 0;
}