bzoj2946 [Poi2000]公共串(SA+二分答案 同poj3450)

求多个串的最长公共子串，一模一样，题解见这里

#include <cstdio>  
#include <cstring>  
#define N 12000 
int mm,m,n,a[N],id[N];  
int rank[N<<1],rank1[N],tmp[N],count[N],sa[N],h[N];  
inline int min(int x,int y){return x<y?x:y;}  
inline bool jud(int x){  
    int cnt=0;  
    bool vis[4005];  
    for(int i=1;i<=n;++i){  
        if(h[i]>=x){  
            if(!vis[id[sa[i]]]) cnt++,vis[id[sa[i]]]=1;  
        }  
        else{  
            memset(vis,0,sizeof(vis));  
            vis[id[sa[i]]]=1;cnt=1;  
        }  
        if(cnt==mm) return 1;
    }return 0;  
}  
int main(){  
//  freopen("a.in","r",stdin);  
    scanf("%d",&mm);  
    char s[2010];int l=1,r=300;n=0,m=30;  
    for(int i=1;i<=mm;++i){  
        scanf("%s",s+1);int len=strlen(s+1);r=min(r,len);  
        for(int j=1;j<=len;++j) a[++n]=s[j]-'a'+1,id[n]=i;  
        a[++n]=++m;id[n]=i;  
    }  
    memset(rank,0,sizeof(rank1));  
    for(int i=1;i<=m;++i) count[i]=0;  
    for(int i=1;i<=n;++i) count[a[i]]=1;  
    for(int i=1;i<=m;++i) count[i]+=count[i-1];  
    for(int i=n;i>=1;--i) rank[i]=count[a[i]];  
    int k=0;  
    for(int p=1;k!=n;p<<=1,m=k){  
        for(int i=1;i<=m;++i) count[i]=0;  
        for(int i=1;i<=n;++i) count[rank[i+p]]++;  
        for(int i=1;i<=m;++i) count[i]+=count[i-1];  
        for(int i=n;i>=1;--i) tmp[count[rank[i+p]]--]=i;  
        for(int i=1;i<=m;++i) count[i]=0;  
        for(int i=1;i<=n;++i) count[rank[tmp[i]]]++;  
        for(int i=1;i<=m;++i) count[i]+=count[i-1];  
        for(int i=n;i>=1;--i) sa[count[rank[tmp[i]]]--]=tmp[i];  
        memcpy(rank1,rank,sizeof(rank1));  
        rank[sa[1]]=k=1;  
        for(int i=2;i<=n;++i){  
            if(rank1[sa[i]]!=rank1[sa[i-1]]||rank1[sa[i]+p]!=rank1[sa[i-1]+p]) ++k;  
            rank[sa[i]]=k;  
        }  
    }k=0;  
    for(int i=1;i<=n;++i){  
        if(rank[i]==1){h[1]=0;continue;}  
        if(i==1||h[rank[i-1]]<=1) k=0;  
        if(k) --k;  
        while(a[i+k]==a[sa[rank[i]-1]+k]) ++k;  
        h[rank[i]]=k;  
    }  
    int ans=0;
    while(l<=r){  
        int mid=l+r>>1;  
        if(jud(mid)) ans=mid,l=mid+1;  
        else r=mid-1;  
    }
    printf("%d\n",ans);
    return 0;  
}