SPOJ SUBST1 后缀数组求字符串中不同子串个数

题目链接：https://www.spoj.com/problems/SUBST1/

思路：对于一个后缀。 它将产生n - sa[k]个前缀，但是有height[k]个前缀是跟前一个字符串的前缀相同。故每个后缀的贡献是n - sa[k] - height[k]。

#include<bits/stdc++.h>
using namespace std;
const int N = 5e4+10;
int num = 122,len;
int fir[N],sec[N],sa[N],t[N],height[N];
char s[N];
inline void SA(){
	for(int i = 1; i <= num; i++) t[i] = 0;
	for(int i = 1; i <= len; i++) ++t[fir[i] = s[i]];
	for(int i = 1; i <= num; i++) t[i]+=t[i-1];
	for(int i = len; i >= 1; i--) sa[t[fir[i]]--] = i;
	for(int k = 1; k <= len; k<<=1){
		int cnt = 0;
		for(int i = len-k+1; i <= len; i++) sec[++cnt] = i;
		for(int i = 1; i <= len; i++) if(sa[i]>k) sec[++cnt] = sa[i]-k;
		for(int i = 1; i <= num; i++) t[i] = 0;
		for(int i = 1; i <= len; i++) ++t[fir[i]];
		for(int i = 1; i <= num; i++) t[i]+=t[i-1];
		for(int i = len; i >= 1; i--) sa[t[fir[sec[i]]]--] = sec[i],sec[i] = 0;
		swap(fir,sec);
		fir[sa[1]] = 1,cnt = 1;
		for(int i = 2; i <= len; i++)
		fir[sa[i]] = (sec[sa[i]] == sec[sa[i-1]] && sec[sa[i]+k] == sec[sa[i-1]+k])?cnt:++cnt;
		if(cnt==len) break;
		num = cnt;
 	} 
}
void Getheight() {
    int j, k = 0;   //目前height数组计算到k
    for (int i = 1; i <= len; i++) {
        if(k) k--;  //由性质得height至少为k-1
        int j = sa[fir[i] - 1];   //排在i前一位的是谁
        while(s[i + k] == s[j + k]) k++;
        height[fir[i]] = k;
    }
    //for(int i = 1; i <= len; i++) printf("%d ",height[i]); 
} 
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
	num = 122;
	memset(t,0,sizeof(t));
	memset(fir,0,sizeof(fir));
	memset(sec,0,sizeof(sec));
	memset(height,0,sizeof(height));
	memset(sa,0,sizeof(sa));
	scanf("%s", s+1);
    len = strlen(s+1);
    SA();
    Getheight();
    long long int ans = 0; 
	for(int i = 1; i <= len; i++)
	ans+=(long long int)(len-sa[i]-height[i]+1);
   	printf("%lld\n",ans);
	}
	return 0;
}