crf 的视察 （二分答案）

crf 的视察

9.3
思路：二分答案，n^2 check。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 2010;

int n, m;
bool mp[N][N];
int cnt[N][N];

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

bool check(int x){
    for(register int i=1; i+x-1<=n; i++){
        for(register int j=1; j+x-1<=m; j++){
            if(cnt[i+x-1][j+x-1] - cnt[i+x-1][j-1] - cnt[i-1][j+x-1] + cnt[i-1][j-1] == 0) return 1;
        }
    }
    return 0;
}

int main(){
    freopen ("inspect.in", "r", stdin);
    freopen ("inspect.out", "w", stdout);
    scanf("%d%d", &n ,&m);
    for(register int i=1; i<=n; i++){
        for(register int j=1; j<=m; j++){
            int cc; cc = read();
            mp[i][j] = cc^1;
            cnt[i][j] = (cnt[i-1][j] + cnt[i][j-1] - cnt[i-1][j-1] + mp[i][j]);
            //printf("Y %d %d %d\n", i, j, cnt[i][j]);
        }
    }
    int l=0, r=2000;
    while(l < r){
        int mid = ((l + r) >> 1) + 1;
        if( check( mid ) ) l = mid;
        else r = mid - 1;
    }
    printf("%d", l);
    return 0;
}