题目:
题意:
给定 n 个字符串,求出现在不小于 n/2 个字符串中的最长子串。
题解:
你说pku好不容易有个数据范围还是错的= =
和前两个题的套路是一样的,只要再记录一下开始的位置就好了
代码:
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N=200005;
int c[N],X[N],n,sa[N],Y[N],rak[N],height[N],len,m,fp,id[N],s[N],*x,*y,z,wz[N];
char st[1205];bool vis[1205];
void build_sa()
{
m=300;x=X;y=Y;
for (int i=0;i<m;i++) c[i]=0;
for (int i=0;i<n;i++) c[x[i]=s[i]]++;
for (int i=1;i<m;i++) c[i]+=c[i-1];
for (int i=n-1;i>=0;i--) sa[--c[x[i]]]=i;
for (int k=1;k<=n;k<<=1)
{
int 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;
for (int i=0;i<m;i++) c[i]=0;
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>=0;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-1]]==y[sa[i]]&&((sa[i]+k>=n?-1:y[sa[i]+k])==(sa[i-1]+k>=n?-1:y[sa[i-1]+k]))?p-1:p++;
if (p>n) break;
m=p;
}
}
void build_lcp()
{
for (int i=0;i<n;i++) rak[sa[i]]=i;
height[0]=0;
int k=0;
for (int i=0;i<n;i++)
{
if (rak[i]==0) continue;
if (k) k--;
int j=sa[rak[i]-1];
while (i+k<n && j+k<n && s[i+k]==s[j+k]) k++;
height[rak[i]]=k;
}
}
bool check(int mid)
{
int cnt=0,minn=N;z=0;
memset(vis,0,sizeof(vis));
for (int i=1;i<n;i++)
if (height[i]>=mid)
{
if (!vis[id[sa[i]]]) vis[id[sa[i]]]=1,cnt++;
minn=min(minn,sa[i]);
if (!vis[id[sa[i-1]]]) vis[id[sa[i-1]]]=1,cnt++;
minn=min(minn,sa[i-1]);
}
else
{
if (cnt>len/2) wz[++z]=minn;
minn=N;cnt=0;
memset(vis,0,sizeof(vis));
}
if (cnt>len/2) wz[++z]=minn;
if (z) return 1;return 0;
}
int main()
{
while(scanf("%d",&len) && len)
{
if (len==1) {scanf("%s",st);printf("%s\n",st);continue;}
n=-1;fp=0;
for (int i=0;i<len;i++)
{
scanf("%s",st);
int ll=strlen(st);
for (int j=0;j<ll;j++) s[++n]=st[j],id[n]=i;
s[++n]='#'+(fp++);
}
build_sa();
build_lcp();
int l=1,r=n,ans=0,zz;
while (l<=r)
{
int mid=(l+r)>>1;
if (check(mid)) ans=mid,zz=z,l=mid+1;
else r=mid-1;
}
if (!ans) printf("?\n\n");
else
{
for (int i=1;i<=zz;i++)
{
for (int j=wz[i];j<wz[i]+ans;j++) printf("%c",s[j]);
printf("\n");
}
printf("\n");
}
}
}