题意是给出N个串,求在超过一半串中出现的最长公共序列。
第一道后缀数组,方法是把每个串加个#连起来,然后求SA和height,二分最长公共序列长度L,遍历height数组,两两之间LCP大于等于L就算一组,如果碰到个小于L或者后一个到#了(因为#的数字要比字母大所以就是到最后了)那么上一组就要结算了,如果个数大于n/2,那么就可以,然后范围缩小到mid+1,y(因为可能有更长的),反之范围到,x,mid-1。
那个保存答案的数组个数我一开始开的100,不停RE,事实上完全可能远远大于100。。一口气开了5000个就A了。
AC代码:
//#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll __int64
#define ull unsigned long long
#define eps 1e-8
#define NMAX 105*1005
#define MOD 1000000007
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
template<class T>
inline void scan_d(T &ret)
{
char c;
int flag = 0;
ret=0;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c == '-')
{
flag = 1;
c = getchar();
}
while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
if(flag) ret = -ret;
}
char ch[NMAX];
int s[NMAX],sa[NMAX],t[NMAX],t2[NMAX],c[NMAX];
int rank[NMAX],height[NMAX];
void build_sa(int n, int m)
{
int i, *x = t, *y = t2;
for(i = 0; i < m; i++) c[i] = 0;
for(i = 0; i < n; i++) c[x[i]=s[i]]++;
for(i = 1; i < m; i++) c[i] += c[i-1];
for(i = n-1; i >= 0; i--) sa[--c[x[i]]] = i;
for(int k = 1; k <= n; k <<= 1)
{
int p = 0;
for(i = n-k; i < n; i++) y[p++] = i;
for(i = 0; i < n; i++) if(sa[i] >= k) y[p++] = sa[i]-k;
for(i = 0; i < m; i++) c[i] = 0;
for(i = 0; i < n; i++) c[x[y[i]]]++;
for(i = 1; i < m; i++) c[i] += c[i-1];
for(i = n-1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
swap(x,y);
p = 1; x[sa[0]] = 0;
for(i = 1; i < n; i++)
x[sa[i]] = (y[sa[i-1]] == y[sa[i]] && y[sa[i-1]+k] == y[sa[i]+k]) ? p-1 : p++;
if(p >= n) break;
m = p;
}
}
void getHeight(int n)
{
int i,k = 0;
for(i = 0; i < n; i++) rank[sa[i]] = i;
for(i = 0; i < n; i++)
{
if(rank[i] == 0)
{
height[rank[i]] = k = 0;
continue;
}
if(k) k--;
int j = sa[rank[i]-1];
while(s[i+k] == s[j+k]) k++;
height[rank[i]] = k;
}
}
int flag[105],pos[NMAX];
char ans[5005][1025];
int main()
{
#ifdef GLQ
freopen("input.txt","r",stdin);
// freopen("o1.txt","w",stdout);
#endif // GLQ
int n,cas = 0;
while(~scanf("%d",&n) && n)
{
if(cas) printf("\n");
else cas++;
int len=0,l = 0;
for(int i = 0; i < n; i++)
{
scanf("%s",ch+len);
int lent = strlen(ch+len);
l = max(l,lent);
len += lent;
ch[len++] = '#';
}
if(n == 1)
{
for(int i = 0; i < len-1; i++)
printf("%c",ch[i]);
printf("\n");
continue;
}
int m = 'z'-'a'+2,ha = 0;
for(int i = 0; i < len; i++)
{
if(ch[i] != '#')
{
s[i] = ch[i]-'a'+1;
pos[i] = ha;
}
else
{
s[i] = m++;
ha++;
}
}
build_sa(len,m);
getHeight(len);
int x=1,y=l,you = 0;
while(x <= y)
{
int mid = (x+y) >> 1,k = 0,tmp = 0;
for(int i = 1; i < len; i++)
{
if(ch[sa[i]] == '#') break;
if(height[i] < mid || (height[i] >= mid && ch[sa[i+1]] == '#'))
{
if(height[i] >= mid && ch[sa[i+1]] == '#')
flag[pos[sa[i]]] = flag[pos[sa[i-1]]] = 1;
else if(!k) continue;
int cal = 0;
for(int I = 0; I < n; I++) if(flag[I]) cal++;
if(cal > n/2)
{
for(int I = 0; I < mid; I++)
ans[tmp][I] = ch[sa[i-1]+I];
ans[tmp][mid] = '\0';
tmp++;
}
memset(flag,0,sizeof(flag));
k = 0;
}
else
{
flag[pos[sa[i]]] = flag[pos[sa[i-1]]] = 1;
k++;
}
}
if(tmp)
{
x = mid+1;
you = tmp;
}
else y = mid-1;
}
// cout<<you<<endl;
// break;
if(you)
{
for(int i = 0; i < you; i++)
printf("%s\n",ans[i]);
}
else printf("?\n");
}
return 0;
}