spoj 694 DISUBSTR - Distinct Substrings （后缀数组）

DISUBSTR - Distinct Substrings

no tags 

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.

题目大意：给定一个字符串，求不相同的子串的个数。

题解：后缀数组

每个子串一定是某个后缀的前缀

将所有的后缀按照suffix(sa[1]),suffix(sa[2]).... suffix(sa[n])的顺序排序，对于每个后缀可以产生n-sa[k]+1个前缀，这些前缀中有height[k]与前一个是相同的，所有产生的新子串的个数就是n-sa[k]+1-height[k]。所以不同的子串数就是sigma(n-sa[k]+1-height[k])

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 20003
using namespace std;
int n,m,k,len,a[N],sa[N],rank[N],height[N],xx[N],yy[N],*x,*y,p;
int b[N];
char s[N];
int cmp(int i,int j,int l)
{
	return y[i]==y[j]&&(i+l>len?-1:y[i+l])==(j+l>len?-1:y[j+l]);
}
void get_SA()
{
	x=xx; y=yy; m=26;
	for (int i=1;i<=len;i++) b[x[i]=a[i]]++;
	for (int i=1;i<=m;i++) b[i]+=b[i-1];
	for (int i=len;i>=1;i--) sa[b[x[i]]--]=i;
	for (int k=1;k<=len;k<<=1) {
		p=0;
		for (int i=len-k+1;i<=len;i++) y[++p]=i;
		for (int i=1;i<=len;i++)
		 if (sa[i]>k) y[++p]=sa[i]-k;
		for (int i=1;i<=m;i++) b[i]=0;
		for (int i=1;i<=len;i++) b[x[y[i]]]++;
		for (int i=1;i<=m;i++) b[i]+=b[i-1];
		for (int i=len;i>=1;i--) sa[b[x[y[i]]]--]=y[i];
		swap(x,y); p=2; x[sa[1]]=1;
		for (int i=2;i<=len;i++)
		 x[sa[i]]=cmp(sa[i-1],sa[i],k)?p-1:p++;
		if (p>len) break;
		m=p+1; 
	}
	p=0;
	for (int i=1;i<=len;i++) rank[sa[i]]=i;
	for (int i=1;i<=len;i++) {
		if (rank[i]==1) continue;
		int j=sa[rank[i]-1];
		while (i+p<=len&&j+p<=len&&a[i+p]==a[j+p]) p++;
		height[rank[i]]=p;
		p=max(0,p-1);
	}
}
int main()
{
	freopen("a.in","r",stdin);
	//freopen("my.out","w",stdout);
	scanf("%d",&n); 
	for (int i=1;i<=n;i++){
		memset(rank,0,sizeof(rank));
		memset(sa,0,sizeof(sa));
		memset(height,0,sizeof(height));
		memset(b,0,sizeof(b));
		scanf("%s",s+1); len=strlen(s+1);
		for (int j=1;j<=len;j++) a[j]=s[j]-'A'+1;
		get_SA();
		int ans=0;
		ans+=len-sa[1]+1;
		for (int j=2;j<=len;j++) ans+=len-sa[j]+1-height[j];
		printf("%d\n",ans);
	}
}