poj 1743 Musical Theme(后缀数组）

前后做差，再利用后缀数组。

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#define rep(i,n) for(int i=0;i<n;i++)
#define maxn 100010
using namespace std;
int r[maxn];
int Rank[maxn],sa[maxn],height[maxn];
int wa[maxn],wb[maxn],wv[maxn],ws[maxn];
char a[maxn],b[maxn];
int cmp(int *r,int a,int b,int le)
{
	return r[a]==r[b]&&r[a+le]==r[b+le];
}
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++;
	}
	return ;
}
void calheight( int *r,int *sa,int n)
{
	int i,j,k=0;
	for ( i = 0; 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++);
	return ;
}
struct pi
{
    int min;
}pp[4*maxn];
void build(int le,int ri,int tot)
{
    if(le==ri)
    {
        pp[tot].min=height[le];
        return ;
    }
    int mid;
    mid=(le+ri)/2;
    build(le,mid,2*tot);
    build(mid+1,ri,2*tot+1);
    pp[tot].min=min(pp[2*tot].min,pp[2*tot+1].min);
    return ;
}
int query(int le,int ri,int tot,int ll,int rr)
{
    int p,q;
    p=100000000;
    q=100000000;
    if(le>ri)
        return 0;
    if(le<=ll&&ri>=rr)
    {
        return pp[tot].min;
    }
    int mid;
    mid=(ll+rr)/2;
    if(le<=mid)
    {
        p=query(le,ri,2*tot,ll,mid);
    }
    if(ri>mid)
    {
        q=query(le,ri,2*tot+1,mid+1,rr);
    }
    if(p==100000000&&q==100000000)
        return 0;
    return min(p,q);
}
int main()
{
    int i,n,m1,k1,m2,k2,p,le,ri,mid,ss;
    while(1)
    {
        scanf("%d",&n);
        if(n==1)
        {
            scanf("%d",&m1);
            printf("0\n");
            continue;
        }
        if(n==0)
            break;
        for(i=0;i<n;i++)
        {
            scanf("%d",&r[i]);
        }
        if(n<5)
        {
            printf("0\n");
            continue;
        }
        for(i=0;i<n-1;i++)
        {
            r[i]=r[i+1]-r[i]+90;
        }
        n--;
        r[n]=0;
        da(r,sa,n+1,200);
        calheight(r,sa,n);
        le=4;
        ri=n;
        while(le<=ri){
            mid=(le+ri)/2;
            ss=0;
            for(i=1;i<n;i++){
                if(height[i]>=mid)
                {
                    p=i;
                    m1=0;k1=100000000;
                    m2=0;
                    k2=10000000;
                    while(p<n&&height[p]>=mid)
                    {
                        
                        if(sa[p-1]>m1)
                            m1=sa[p-1];
                        if(sa[p-1]<k1)
                            k1=sa[p-1];
                        if(sa[p]>m2)
                            m2=sa[p];
                        if(sa[p]<k2)
                            k2=sa[p];
                        if(abs(k2-m1)>=mid||abs(k1-m2)>=mid||abs(k2-k1)>=mid||abs(m1-m2)>=mid)
                        {
                            ss=1;
                            break;
                        }
                        p++;
                    }
                    if(ss)  break;
                    i=p;
                }
                
            }
            if(!ss)
            {
                ri=mid-1;
            }
            else
                le=mid+1;
        }
        if(ri>=4)
            printf("%d\n",ri+1);
        else
            printf("0\n");
    }
    return 0;
}