Description
Input
Output
Sample Input
3 4
1 1 0 1
0 1 1 0
0 1 1 0
5
1 1 2 3
2 1 3 2
3 2 3 4
1 1 3 4
1 2 3 4
Sample Output
1
1
1
2
2
Data Constraint
The Solution
很容易想到一个递推式。
设f[i][j]表示以(i,j)为右下角的最大正方形的边长
递推式很简单:
f[i][j]=min(min(f[i−1][j],f[i][j−1]),f[i−1][j−1])+1;(a[i][j]!=0)
最朴素的方法就是可以直接二分答案了
然而这无疑是会超时的。。。
注意到这是查询区间最大值的,所以我们可以考虑一下Rmq
可这可是求矩阵内的啊,怎么办!!
没错我们可以采用二维Rmq。
我们设Rmq[k][l][i][j]表示以(i,j)为右下角,向上2^i个格子,向左2^j个格子矩形内f的最大答案
这个时间复杂度是(n^2log^2),然后每次查询可行是O(1)的,询问是O(Tlog)
的
CODE
#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#define fo(i,a,b) for (int i=a;i<=b;i++)
#define fd(i,a,b) for (int i=a;i>=b;i--)
#define N 1005
#define ll long long
using namespace std;
int a[N][N],n,m,f[N][N],Rmq[11][11][N][N];
int Two[11];
void Pretreatment_rmq()
{
fo(k,1,log2(n))
fo(i,1,n)
fo(j,1,m)
Rmq[0][k][i][j] = max(Rmq[0][k - 1][i][j],Rmq[0][k-1][i][j-Two[k-1]]),
Rmq[k][0][i][j] = max(Rmq[k - 1][0][i][j],Rmq[k - 1][0][i-Two[k-1]][j]);
fo(k,1,log2(n))
fo(l,1,log2(m))
fo(i,Two[k],n)
fo(j,Two[l],m)
Rmq[k][l][i][j] = max(Rmq[k][l-1][i][j],Rmq[k][l-1][i][j-Two[l-1]]);
}
int Query(int x1,int y1,int x2,int y2)
{
if (x1>x2 || y1>y2) return 0;
int z = log2(x2-x1+1),z1 = log2(y2-y1+1);
int Res = max(Rmq[z][z1][x2][y2],Rmq[z][z1][x2][y1+Two[z1]-1]);
Res = max(Res,max(Rmq[z][z1][x1+Two[z]-1][y2],Rmq[z][z1][x1+Two[z]-1][y1+Two[z1]-1]));
return Res;
}
int main()
{
freopen("square.in","r",stdin);
freopen("square.out","w",stdout);
scanf("%d%d",&n,&m);
Two[0] = 1;
fo(i,1,10) Two[i] = Two[i - 1] * 2;
fo(i,1,n) fo(j,1,m)
{
scanf("%d",&a[i][j]);
if (a[i][j]) Rmq[0][0][i][j] = f[i][j] = min(min(f[i-1][j],f[i][j-1]),f[i-1][j-1]) + 1;
}
Pretreatment_rmq();
int T;
scanf("%d",&T);
int x1,x2,y1,y2;
while (T--)
{
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
int l = 0, r = min(x2-x1+1,y2-y1+1);
while (l+1<r)
{
int mid = (l + r) >> 1;
if (Query(x1+mid-1,y1+mid-1,x2,y2) >= mid) l = mid;
else r = mid - 1;
}
while (Query(x1+l+1-1,y1+l+1-1,x2,y2) >= l + 1) l ++;
printf("%d\n",l);
}
return 0;
}