[Dp] Matrix largest square

1 represents a practical matrix, 0 denotes not feasible, taking a maximum square

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int INF=2147483647;
int n,m;
int a[105][105];
int dp[105][105];
int main()
{
    scanf("%d %d",&n,&m);
    int mx=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            scanf("%d",&a[i][j]);
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(a[i][j]==1){
            dp[i][j]=min(min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1])+1;
            mx=max(mx,dp[i][j]);
            //cout<<i<<" "<<j<<" "<<dp[i][j]<<" "<<mx<<endl;
            }
        }
    }
    printf("%d\n",mx);
    return 0;
}