L - Largest Allowed Area

https://cn.vjudge.net/contest/296345#problem/L

思路：求最大子矩阵；1：二分，关闭同步流都会tle。。只能输入挂；2：单调 队列，在上一个方阵下减多一行一列还是合法，再从该点延申

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

int mp[maxn][maxn];
int sum[maxn][maxn];
int n,m;
bool ch(int x)
{
    for(int i=1;i+x-1<=n;i++)
    {
        for(int j=1;j+x-1<=m;j++)
        {
            if(sum[i+x-1][j+x-1]-sum[i+x-1][j-1]-sum[i-1][j+x-1]+sum[i-1][j-1]<=1) return 1;
        }
    }
    return 0;
}

int main()
{
    //FAST_IO;

    int T;
    //cin>>T;
    T=read();
    while(T--)
    {
        //cin>>n>>m;
        n=read();
        m=read();
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                //cin>>sum[i][j];
                sum[i][j]=read();
                sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
            }
        }
        int l=0;
        int r=n;
        int ans=0;
        while(l<=r)
        {
            int mid=(l+r)>>1;
            if(ch(mid)) l=mid+1,ans=mid;
            else r=mid-1;

        }
        //cout<<ans<<endl;
        printf("%d\n",ans);
    }

    return 0;
}

 

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

int mp[maxn][maxn];
int sum[maxn][maxn];
int n,m;
int dp[maxn][maxn];

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);
    int T;
    //cin>>T;
    T=read();
    while(T--)
    {
        //cin>>n>>m;
        n=read();
        m=read();
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                //cin>>sum[i][j];
                sum[i][j]=read();
                sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
            }
        }

        int ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                dp[i][j]=dp[i-1][j-1]-1;
                if(dp[i][j]<1) dp[i][j]=1;
                while(i+dp[i][j]<=n&&j+dp[i][j]<=m&&(sum[i+dp[i][j]][j+dp[i][j]]-sum[i+dp[i][j]][j-1]-sum[i-1][j+dp[i][j]]+sum[i-1][j-1]<=1)) dp[i][j]++;
                ans=max(ans,dp[i][j]);
            }
        }
        //cout<<ans<<endl;
        printf("%d\n",ans);
    }

    return 0;
}