poj1743 Musical Theme(后缀数组+二分判定)

题意：求不重叠最长重复子串

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<cmath>
#define ll __int64
using namespace std;
const int INF=0x3fffffff;
const int maxn =20005*2;
int wa[maxn],wb[maxn],wv[maxn],ws1[maxn],sa[maxn];
int rank[maxn],height[maxn];
int a[maxn];

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++)ws1[i]=0;
    for(i=0; i<n; i++)ws1[x[i]=r[i]]++;
    for(i=1; i<m; i++)ws1[i]+=ws1[i-1];
    for(i=n-1; i>=0; i--)sa[--ws1[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++) ws1[i]=0;
        for(i=0; i<n; i++) ws1[wv[i]]++;
        for(i=1; i<m; i++) ws1[i]+=ws1[i-1];
        for(i=n-1; i>=0; i--) sa[--ws1[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 calheight(int *r,int *sa,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++);
}

int lcp(int i,int j)//原串中suffix[i]与suffix[j]的lcp
{
    //rmq解决
    //rank[i]<rank[j]
    //return min(height[ rank[i]+1 ]......height[ rank[j] ])
    return 0;
}


//二分答案,mid为长度
bool check(int mid,int n)
{
    for(int i=1;i<=n;i++){
        if(height[i]>=mid){
            for(int j=i-1;j>=1;j--){
                if(abs(sa[i]-sa[j])>=mid){
                    return true;
                }
                if(height[j]<mid) break;
            }
        }
    }
    return false;
}

int main()
{
    //freopen("d:\\Test.txt","r",stdin);
    int n;
    while(scanf("%d",&n)!=EOF){
        if(n==0) break;
        n--;
        for(int i=0;i<=n;i++){
            scanf("%d",&a[i]);
        }
        for(int i=0;i<n;i++){
            a[i]=a[i+1]-a[i]+90;
        }
        a[n]=0;
        da(a,sa,n+1,200);
        calheight(a,sa,n);
        int ans=0;
        int l=3,r=n,mid;
        while(r>=l){
            mid=(l+r)/2;
            if(check(mid,n)){
                l=mid+1;
                ans=mid;
            }
            else{
                r=mid-1;
            }
        }
        if(ans<4) cout<<0<<endl;
        else cout<<ans+1<<endl;
    }
    return 0;
}