hdu 3518 Boring counting —— 后缀数组

Problem Description
035 now faced a tough problem,his english teacher gives him a string,which consists with n lower case letter,he must figure out how many substrings appear at least twice,moreover,such apearances can not overlap each other.
Take aaaa as an example.”a” apears four times,”aa” apears two times without overlaping.however,aaa can’t apear more than one time without overlaping.since we can get “aaa” from [0-2](The position of string begins with 0) and [1-3]. But the interval [0-2] and [1-3] overlaps each other.So “aaa” can not take into account.Therefore,the answer is 2(“a”,and “aa”).

Input
The input data consist with several test cases.The input ends with a line “#”.each test case contain a string consists with lower letter,the length n won’t exceed 1000(n <= 1000).

Output
For each test case output an integer ans,which represent the answer for the test case.you’d better use int64 to avoid unnecessary trouble.

Sample Input
aaaa
ababcabb
aaaaaa

Sample Output
2
3
3

Source
2010 ACM-ICPC Multi-University Training Contest（9）——Host by HNU

for一遍所有的可能性，因为同一个前缀是连续的，所以只需要在$high<k$的时候判断是否有两个及以上出现过的就好了

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
const int MAXN =(int)1e4+10;
int wa[MAXN],wb[MAXN],wv[MAXN],we[MAXN],rk[MAXN];
int cmp(int *r,int a,int b,int l){return r[a]==r[b]&&r[a+l]==r[b+l];}
void build_sa(int *r,int *sa,int n,int m){
    int i,j,p,*x=wa,*y=wb,*t;
    for(i=0;i<m;i++)we[i]=0;
    for(i=0;i<n;i++)we[x[i]=r[i]]++;
    for(i=1;i<m;i++)we[i]+=we[i-1];
    for(i=n-1;i>=0;i--)sa[--we[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++)we[i]=0;
        for(i=0;i<n;i++)we[wv[i]]++;
        for(i=1;i<m;i++)we[i]+=we[i-1];
        for(i=n-1;i>=0;i--)sa[--we[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++;
    }
}
int height[MAXN];
void calheight(int *r,int *sa,int n){
    int i,j,k=0;
    for(i=1;i<=n;i++)rk[sa[i]]=i;
    for(i=0;i<n;height[rk[i++]]=k){
        for(k?k--:0,j=sa[rk[i]-1];r[i+k]==r[j+k];k++);
    }
}
int sa[MAXN],a[MAXN],next[MAXN];
char s[MAXN];
int n,k;
ll check(int K)
{
    int minsa=1e5,maxsa=0;
    ll ans=0;
        for(int i=1;i<=n;i++)
        {
            if(height[i]<K)
            {
                if(maxsa-minsa>=K)
                    ans++;
                maxsa=minsa=sa[i];
            }
            else
            {
                minsa=min(minsa,sa[i]);
                maxsa=max(maxsa,sa[i]);
            }
        }

    if(maxsa-minsa>=K)
        ans++;
    return ans;
}
int main()
{
    while(~scanf("%s",s))
    {
        if(s[0]=='#')
            break;
        n=strlen(s);
        for(int i=0;i<n;i++)
            a[i]=s[i]-'a'+1;
        a[n]=0;
        build_sa(a,sa,n+1,100);
        calheight(a,sa,n);
        /*for(int i=n;i>=1;i--)
        {
            if(height[i+1]==0)
                next[i]=i+1;
            else
                next[i]=next[i+1];
        }*/
        ll ans=0;
        for(int i=1;i<=n/2;i++)
            ans+=check(i);
        printf("%lld\n",ans);
    }

    return 0;
}