SPOJ(后缀数组求不同子串个数)

DISUBSTR - Distinct Substrings

Given a string, we need to find the total number of its distinct substrings.

Input

T- number of test cases. T<=20;
Each test case consists of one string, whose length is <= 1000

Output

For each test case output one number saying the number of distinct substrings.

Example

Sample Input:
2
CCCCC
ABABA

Sample Output:
5
9

Explanation for the testcase with string ABABA: 
len=1 : A,B
len=2 : AB,BA
len=3 : ABA,BAB
len=4 : ABAB,BABA
len=5 : ABABA
Thus, total number of distinct substrings is 9.

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=;
char buf[MAXN];
int sa[MAXN];
int rnk[MAXN];
int tmp[MAXN];
int lcp[MAXN];
int len,k;

bool comp(int i,int j)
{
    if(rnk[i]!=rnk[j])    return rnk[i]<rnk[j];
    else{
        int ri=(i+k<=len)?rnk[i+k]:-;
        int rj=(j+k<=len)?rnk[j+k]:-;
        return ri<rj;
    }
}

void getsa()
{
    memset(rnk,,sizeof(rnk));
    memset(sa,,sizeof(sa));
    memset(tmp,,sizeof(tmp));

    len=strlen(buf);
    for(int i=;i<len;i++)
    {
        sa[i]=i;
        rnk[i]=buf[i]-'A';
    }
    sa[len]=len;
    rnk[len]=-;

    for(k=;k<=len;k*=)
    {
        sort(sa,sa+len+,comp);

        tmp[sa[]]=;
        for(int i=;i<=len;i++)
        {
            tmp[sa[i]]=tmp[sa[i-]]+(comp(sa[i-],sa[i])?:);
        }

        for(int i=;i<=len;i++)
        {
            rnk[i]=tmp[i];
        }
    }
}

void getlcp()
{
    memset(rnk,,sizeof(rnk));
    memset(lcp,,sizeof(lcp));
    getsa();
    for(int i=;i<=len;i++)
    {
        rnk[sa[i]]=i;
    }

    int h=;
    lcp[]=h;
    for(int i=;i<len;i++)
    {
        int j=sa[rnk[i]-];
        if(h>)    h--;
        for(;h+i<len&&h+j<len;h++)
            if(buf[i+h]!=buf[j+h])    break;
        lcp[rnk[i]-]=h;
    }
}

void debug()
{
    for(int i=;i<=len;i++)
    {
        int l=sa[i];
        if(l==len)
        {
            printf("%d %d\n",l,lcp[i]);
        }
        else
        {
            for(int j=l;j<len;j++)
                printf("%c ",buf[j]);
            printf("%d\n",lcp[i]);
        }
    }

}
int T;
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s",buf);
        int res=;
        getlcp();
        res+=(len+)*len/;
        for(int i=;i<=len;i++)
            res-=lcp[i];
        printf("%d\n",res);
    }

    return ;
}