Largest Allowed Area（二分）

题目描述
A company is looking for land to build its headquarters. It has a lot of money and can buy as many land patches as it needs. Its goal, however, is finding the largest square region containing no forest. Unfortunately, there is no such region that is large enough for the headquarters they want to build.

After negotiation with the government and the evaluation of environmental impacts, the government allows the company to purchase land with at most one forest patch. In other words, the company’s goal is now finding the largest square region containing at most one forest patch.

To facilitate the search process, the company creates a map in the form of a 2D table consisting R rows and C columns. In this 2D table, each entry represents a land of patch where 0 corresponds to a non-forest patch and 1 to a forest patch. Unfortunately, the map may have up to 1,000 x 1,000 entries and it is not a good idea to manually look for the largest allowed square region. This is where your skill comes into play. Write an efficient algorithm to find such a square region.

输入
The first line is a positive integer T <= 20 representing the number of test cases. For each case, the input is formatted as follows.

Note: there is at least one non-forest patch in each test case.

输出
There are T lines in the output. Each line is the number of rows in the largest allowed square region for each case.

样例输入
2
10 20
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
20 10
1 0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 0 0 0 0 1 1 0
0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0

样例输出
9
7

思路
通过最大前缀和方法找出最少为1的地块，搜索地块需要二分查找

代码实现

#include<cstdio>
#include<cstring>
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int t,ff,f[1010][1010],k1,i,j,n,m,ans,k;
char ch;
int main()
{
    scanf("%d",&t);
    while (t--)
    {
        memset(f,0,sizeof(f));
        ans=ff=0;
        scanf("%d%d",&n,&m);
        for (int i=1; i<=n; ++i)
        {
            for (int j=1; j<=m; ++j)
            {
                int t;
                ch=getchar();
                while (ch<'0'||ch>'9') ch=getchar();
                t=ch-'0';
                f[i][j]=f[i-1][j]+f[i][j-1]-f[i-1][j-1]+t;
            }
        }
 
        for (int i=1; i<=n; ++i)
        {
            for (int j=1; j<=m; ++j)
            {
                int l=1,r=min(i,j),now=0;
                while(l<=r)
                {
                    int mid=(l+r)/2;
                    if(f[i][j]+f[i-mid][j-mid]-f[i][j-mid]-f[i-mid][j]<=1)
                    {
                        now=mid;
                        l=mid+1;
                    }
                    else r=mid-1;
                }
                ans=max(now,ans);
            }
        }
        printf("%d\n",ans);
}
}