BZOJ1567&&P4398 [JSOI2008]Blue Mary的战役地图

二维hash+二分

先每一行hash一下，然后二分一个边长，再正方形hash一下，压到一个数组里，lowerbound看看有木有相同的

然后就没了

代码(减一过题了解一下)

//By AcerMo
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ull unsigned long long int
using namespace std;
const int p1=17117;
const int p2=521993;
ull squ[5005];
ull n,a[55][55],b[55][55];
ull sum1[55][55],sum2[55][55],pw[55]={0,1};
inline int cala(int x,int y,int l)
{
	ull ans=1;
	for (int i=x;i<=x+l-1;i++)
	ans=ans*p2+sum1[i][y+l-1]-sum1[i][y-1]*pw[l];
	return ans;
}
inline int calb(int x,int y,int l)
{
	ull ans=1;
	for (int i=x;i<=x+l-1;i++)
	ans=ans*p2+sum2[i][y+l-1]-sum2[i][y-1]*pw[l];
	return ans;
}
inline bool che(int x)
{
	int cnt=0;
	for (int i=1;i<=n-x+1;i++)
	for (int k=1;k<=n-x+1;k++)
	squ[++cnt]=cala(i,k,x);
	sort(squ+1,squ+cnt+1);
	for (int i=1;i<=n-x+1;i++)
	for (int k=1;k<=n-x+1;k++)
	{
		int emm=calb(i,k,x);
		if (*lower_bound(squ+1,squ+cnt+1,emm)==emm) return 1;
	}
	return 0;
}
signed main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	for (int k=1;k<=n;k++)
	scanf("%d",&a[i][k]);
	for (int i=1;i<=n;i++)
	for (int k=1;k<=n;k++)
	scanf("%d",&b[i][k]);
	for (int i=1;i<=n;i++)
	sum1[i][0]=sum2[i][0]=1;
	for (int i=1;i<=n;i++)
	for (int k=1;k<=n;k++)
	sum1[i][k]=sum1[i][k-1]*p1+a[i][k];
	for (int i=1;i<=n;i++)
	for (int k=1;k<=n;k++)
	sum2[i][k]=sum2[i][k-1]*p1+b[i][k];
	for (int i=1;i<=n;i++) pw[i]=pw[i-1]*p1;
	int l=1,r=n;
	while (l<r)
	{
		int mid=(l+r)>>1;
		if (che(mid)) l=mid+1;
		else r=mid;
	}
	cout<<l-1;
	return 0;
}