二维hash,然后二分最长公共正方形的边长,把a的都扔到map里,然后用b的去查询有没有。复杂度 O(n2log2n)
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
#define ull unsigned long long
#define N 60
#define k1 11113
#define k2 11117
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,tim=0;map<ull,int>mp;
ull hsa[N][N],hsb[N][N],bin1[N],bin2[N];
inline bool jud(int x){
++tim;
for(int i=x;i<=n;++i)
for(int j=x;j<=n;++j){
ull res=hsa[i][j]-hsa[i-x][j]*bin2[x]-hsa[i][j-x]*bin1[x]+hsa[i-x][j-x]*bin1[x]*bin2[x];
mp[res]=tim;
}
for(int i=x;i<=n;++i)
for(int j=x;j<=n;++j){
ull res=hsb[i][j]-hsb[i-x][j]*bin2[x]-hsb[i][j-x]*bin1[x]+hsb[i-x][j-x]*bin1[x]*bin2[x];
if(mp[res]==tim) return 1;
}return 0;
}
int main(){
// freopen("a.in","r",stdin);
n=read();bin1[0]=bin2[0]=1;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j) hsa[i][j]=hsa[i][j-1]*k1+read();
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j) hsa[i][j]+=hsa[i-1][j]*k2;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j) hsb[i][j]=hsb[i][j-1]*k1+read();
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j) hsb[i][j]+=hsb[i-1][j]*k2;
for(int i=1;i<=n;++i) bin1[i]=bin1[i-1]*k1;
for(int i=1;i<=n;++i) bin2[i]=bin2[i-1]*k2;
int l=0,r=n;
while(l<=r){
int mid=l+r>>1;
if(jud(mid)) l=mid+1;
else r=mid-1;
}printf("%d\n",l-1);
return 0;
}