POJ3294Life Forms【后缀数组】

Language: Default Life Forms Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 11123   Accepted: 3068 Description You may have wondered why most extraterrestrial life forms resemble humans, differing by superficial traits such as height, colour, wrinkles, ears, eyebrows and the like. A few bear no human resemblance; these typically have geometric or amorphous shapes like cubes, oil slicks or clouds of dust. The answer is given in the 146th episode of Star Trek - The Next Generation, titled The Chase. It turns out that in the vast majority of the quadrant's life forms ended up with a large fragment of common DNA. Given the DNA sequences of several life forms represented as strings of letters, you are to find the longest substring that is shared by more than half of them. Input Standard input contains several test cases. Each test case begins with 1 ≤ n ≤ 100, the number of life forms. n lines follow; each contains a string of lower case letters representing the DNA sequence of a life form. Each DNA sequence contains at least one and not more than 1000 letters. A line containing 0 follows the last test case. Output For each test case, output the longest string or strings shared by more than half of the life forms. If there are many, output all of them in alphabetical order. If there is no solution with at least one letter, output "?". Leave an empty line between test cases. Sample Input 3 abcdefg bcdefgh cdefghi 3 xxx yyy zzz 0 Sample Output bcdefg cdefgh ? Source Waterloo Local Contest, 2006.9.30

题意：求超过所有字符串数量一半的公共子串

#include <cstdio>
#include <cstdlib>
#include <cstring>
#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ((x)<tb?(x)*3+1:((x)-tb)*3+2)
using namespace std;
const int MAX=400010;
int rank[MAX],s[MAX],sa[MAX],height[MAX];
int wa[MAX],wb[MAX],ws[MAX],len[110],wv[MAX];
int pos[MAX],vis[110];
char str[MAX];
int c0(int *r,int a,int b){
	return r[a]==r[b]&&r[a+1]==r[b+1]&&r[a+2]==r[b+2];
}
int c12(int k,int *r,int a,int b){
	if(k==2)return r[a]<r[b]||r[a]==r[b]&&c12(1,r,a+1,b+1);
	else return r[a]<r[b]||r[a]==r[b]&&wv[a+1]<wv[b+1];
}
void sort(int *r,int *a,int *b,int n,int m){
	int i;
	for(i=0;i<n;++i)
		wv[i]=r[a[i]];
	for(i=0;i<m;++i)
		ws[i]=0;
	for(i=0;i<n;++i) 
		ws[wv[i]]++;
	for(i=1;i<m;++i)
		ws[i]+=ws[i-1];
	for(i=n-1;i>=0;--i)
		b[--ws[wv[i]]]=a[i];
	return ;
}
void dc3(int *r,int *sa,int n,int m)
{
	int i,j,*rn=r+n,*san=sa+n,ta=0,tb=(n+1)/3,tbc=0,p;
	r[n]=r[n+1]=0;
	for(i=0;i<n;++i){
		if(i%3!=0) 
			wa[tbc++]=i;
	}
	sort(r+2,wa,wb,tbc,m);
	sort(r+1,wb,wa,tbc,m);
	sort(r,wa,wb,tbc,m);
	for(p=1,rn[F(wb[0])]=0,i=1;i<tbc;i++)
		rn[F(wb[i])]=c0(r,wb[i-1],wb[i])?p-1:p++;
	if(p<tbc) 
		dc3(rn,san,tbc,p);
	else {
		for(i=0;i<tbc;++i) 
			san[rn[i]]=i;
	}
	for(i=0;i<tbc;++i){
		if(san[i]<tb)
			 wb[ta++]=san[i]*3;
	}
	if(n%3==1) 
		wb[ta++]=n-1;
	sort(r,wb,wa,ta,m);
	for(i=0;i<tbc;++i) 
		wv[wb[i]=G(san[i])]=i;
	for(i=0,j=0,p=0;i<ta && j<tbc;++p)
		sa[p]=c12(wb[j]%3,r,wa[i],wb[j])?wa[i++]:wb[j++];
	for(;i<ta;++p) 
		sa[p]=wa[i++];
	for(;j<tbc;++p) 
		sa[p]=wb[j++];
	return;
}
void getHeight(int *r,int n){
    int i, j, k = 0;  
    for(i=1;i<=n;++i) rank[sa[i]] = i;  
    for(i=0;i<n;height[rank[i++]]=k){  
        for(k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];k++);  
    }  
}
bool judge(int mid,int n,int k){
	memset(vis,0,sizeof(vis));
	int num=0,ans=0;
	for(int i=1;i<=n;++i){
		if(height[i]>=mid){
			for(int j=1;j<=k;++j){
				if(sa[i]>len[j-1]&& sa[i]<len[j]){
					ans+=(vis[j]?0:1);
					vis[j]=1;
				}
				if(sa[i-1]>len[j-1]&&sa[i-1]<len[j]){
					ans+=(vis[j]?0:1);
					vis[j]=1;
				}
			}
		}
		else{
			if(ans>k/2)pos[++num]=sa[i-1];
			ans=0;
			memset(vis,0,sizeof(vis));
		}
	}
	if(ans>k/2)pos[++num]=sa[n];
	if(num){
		pos[0]=num;
		return true;
	} 
	return false;
}

int main(){
	int k,n,flag=0,i,j;len[0]=-1;
	while(scanf("%d",&k),k){
		pos[0]=n=0;int t=30;
		for(i=1;i<=k;++i){
			scanf("%s",str);
			int l=strlen(str);
			for(j=0;j<l;++j){
				s[n++]=str[j]-'a'+1;
			}
			len[i]=n;
			s[n++]=t++;
		}
		s[n-1]=0;
		dc3(s,sa,n,t);
		getHeight(s,n-1);
		int l=1,r=n,mid;
		while(l<=r){
			mid=(l+r)>>1;
			if(judge(mid,n,k))l=mid+1;
			else r=mid-1;
		}
		if(flag++)printf("\n");
		if(l-1 == 0)printf("?\n");
		else{
			for(i=1;i<=pos[0];++i){
				for(j=pos[i];j<pos[i]+l-1;++j)
					printf("%c",s[j]+'a'-1);
				printf("\n");
			}
		}
	}
	return 0;
}

倍增

#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int MAX=400010;
int rank[MAX],s[MAX],sa[MAX],height[MAX];
int wa[MAX],wb[MAX],ws[MAX],len[110],wv[MAX];
int pos[MAX],vis[110];
char str[MAX];
int cmp(int *r,int a,int b,int l){
	return r[a]==r[b]&&r[a+l]==r[b+l];
}
void da(int *r,int *sa,int n,int m)
{
	int i,j,p,*x=wa,*y=wb,*t;
	for(i=0;i<m;++i) ws[i]=0;
	for(i=0;i<n;++i) ws[x[i]=r[i]]++;
	for(i=1;i<m;++i) ws[i]+=ws[i-1];
	for(i=n-1;i>=0;--i) sa[--ws[x[i]]]=i;
	for(j=1,p=1;p<n;j*=2,m=p)
	{
		for(p=0,i=n-j;i<n;++i) y[p++]=i;
		for(i=0;i<n;++i) if(sa[i]>=j) y[p++]=sa[i]-j;
		for(i=0;i<n;++i) wv[i]=x[y[i]];
		for(i=0;i<m;++i) ws[i]=0;
		for(i=0;i<n;++i) ws[wv[i]]++;
		for(i=1;i<m;++i) ws[i]+=ws[i-1];
		for(i=n-1;i>=0;--i) sa[--ws[wv[i]]]=y[i];
		for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;++i)
		x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
	}
}
void getHeight(int *r,int n){
    int i, j, k = 0;  
    for(i=1;i<=n;++i) rank[sa[i]] = i;  
    for(i=0;i<n;height[rank[i++]]=k){  
        for(k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];k++);  
	}  
}
bool judge(int mid,int n,int k){
	memset(vis,0,sizeof(vis));
	int num=0,ans=0;
	for(int i=1;i<=n;++i){
		if(height[i]>=mid){
			for(int j=1;j<=k;++j){
				if(sa[i]>len[j-1]&& sa[i]<len[j]){
					ans+=(vis[j]?0:1);
					vis[j]=1;
				}
				if(sa[i-1]>len[j-1]&&sa[i-1]<len[j]){
					ans+=(vis[j]?0:1);
					vis[j]=1;
				}
			}
		}
		else{
			if(ans>k/2)pos[++num]=sa[i-1];
			ans=0;
			memset(vis,0,sizeof(vis));
		}
	}
	if(ans>k/2)pos[++num]=sa[n];
	if(num){
		pos[0]=num;
		return true;
	} 
	return false;
}

int main(){
	int k,n,flag=0,i,j;len[0]=-1;
	while(scanf("%d",&k),k){
		pos[0]=n=0;int t=30;
		for(i=1;i<=k;++i){
			scanf("%s",str);
			int l=strlen(str);
			for(j=0;j<l;++j){
				s[n++]=str[j]-'a'+1;
			}
			len[i]=n;
			s[n++]=t++;
		}
		s[n-1]=0;
		da(s,sa,n,t);
		getHeight(s,n-1);
		int l=1,r=n,mid;
		while(l<=r){
			mid=(l+r)>>1;
			if(judge(mid,n,k))l=mid+1;
			else r=mid-1;
		}
		if(flag++)printf("\n");
		if(l-1 == 0)printf("?\n");
		else{
			for(i=1;i<=pos[0];++i){
				for(j=pos[i];j<pos[i]+l-1;++j)
					printf("%c",s[j]+'a'-1);
				printf("\n");
			}
		}
	}
	return 0;
}