最长公共子串模板

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline int read()
{
	int x=0;bool f=0;char c=getchar();
	for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
	for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
	return f?-x:x;
}
const int N=100010;
int T,n,m,ans,st[N],t,cun1[N],cun2[N],lp[N],rp[N];
int c[N],na0[N],na1[N],sa[N],rk[N],h[N];
char str[N];
 
void cal_sa(int n,int m)
{
	int *x=na0,*y=na1;
	for (int i=0;i<=n+1||i<=m+1;i++) c[i]=0;
	for (int i=0;i<n;i++) c[x[i]=str[i]]++;
	for (int i=1;i<=m;i++) c[i]+=c[i-1];
	for (int i=n-1;~i;i--) sa[--c[x[i]]]=i;
	for (int k=1,p=1;p<n;k<<=1,m=p)
	{
		p=0;
		for (int i=n-k;i<n;i++) y[p++]=i;
		for (int i=0;i<n;i++) if (sa[i]>=k) y[p++]=sa[i]-k;
		memset(c,0,sizeof(int)*(m+1));
		for (int i=0;i<n;i++) c[x[y[i]]]++;
		for (int i=1;i<=m;i++) c[i]+=c[i-1];
		for (int i=n-1;~i;i--) sa[--c[x[y[i]]]]=y[i];
		swap(x,y);p=1;x[sa[0]]=0;
		for (int i=1;i<n;i++) 
			x[sa[i]]=(y[sa[i]]==y[sa[i-1]]&&y[sa[i]+k]==y[sa[i-1]+k])?p-1:p++;
	}
	for (int i=0;i<n;i++) rk[sa[i]]=i;
	for (int i=0,j,k=0;i<n-1;h[rk[i++]]=k)
		for ((k?k--:0),j=sa[rk[i]-1];str[i+k]==str[j+k];k++);
}
 
int main()
{
	T=read();
	cun1[0]=cun2[0]=0;
	while (T--){
		scanf("%s",str);
		n=strlen(str),str[n]='#';
		scanf("%s",str+n+1);
		m=strlen(str);
		cal_sa(m+1,300);
		for (int i=1;i<=m;i++) cun1[i]=cun1[i-1]+(sa[i]<n),cun2[i]=cun2[i-1]+(sa[i]>n);
		ans=t=0;
		for (int i=1;i<=m;i++){
			while (t&&h[st[t]]>=h[i]) t--;
			lp[i]=(t?st[t]:1);
			st[++t]=i;
		}
		t=0;
		for (int i=m;i;i--){
			while (t&&h[st[t]]>=h[i]) t--;
			rp[i]=(t?st[t]-1:m);
			st[++t]=i;
		}
		for (int i=1;i<=m;i++){
			if ((cun1[i-1]-cun1[lp[i]-1]>0&&cun2[rp[i]]-cun2[i-1])||(cun2[i-1]-cun2[lp[i]-1]>0&&cun1[rp[i]]-cun1[i-1])) ans=max(ans,h[i]);
		}
		printf("%d\n",ans);
	}
	return 0;
}