后缀数组模板【求不同字串的个数】

ldq链接：https://li-fish.github.io/2018/05/03/cjqx5558400d04kc2v3xgtu1d/

sa[i]表示排名为i的后缀位置

rank[i]表示以suf(i)的排名

height[i]表示suf(sa[i])和suf(sa[i-1])的最长公共前缀

ch下标从0开始，n是ch的长度

#include <bits/stdc++.h>

using namespace std;
const int MAX = 200010;
const int SIGMA_SIZE = 256;
int cntA[MAX], cntB[MAX], sa[MAX], tsa[MAX], A[MAX], B[MAX], height[MAX], Rank[MAX];
int n, data[MAX];
int bucket[SIGMA_SIZE];

char s[MAX];
void get_SA(char *ch) {
    for (int i = 0; i < SIGMA_SIZE; i++) bucket[i] = 0;
    for (int i = 1; i <= n; i++) bucket[ch[i - 1]]++;
    for (int i = 1; i < SIGMA_SIZE; i++) bucket[i] += bucket[i - 1];
    for (int i = n; i; i--) sa[bucket[ch[i - 1]]--] = i;
    Rank[sa[1]] = 1;
    for (int i = 2; i <= n; i++) {
        Rank[sa[i]] = Rank[sa[i - 1]];
        if (ch[sa[i] - 1] != ch[sa[i - 1] - 1]) Rank[sa[i]]++;
    }
    for (int l = 1; Rank[sa[n]] < n; l <<= 1) {
        memset(cntA, 0, sizeof(cntA));
        memset(cntB, 0, sizeof(cntB));
        for (int i = 1; i <= n; i++) {
            cntA[A[i] = Rank[i]]++;
            cntB[B[i] = (i + l <= n) ? Rank[i + l] : 0]++;
        }
        for (int i = 1; i <= n; i++) cntB[i] += cntB[i - 1];
        for (int i = n; i; i--) tsa[cntB[B[i]]--] = i;
        for (int i = 1; i <= n; i++) cntA[i] += cntA[i - 1];
        for (int i = n; i; i--) sa[cntA[A[tsa[i]]]--] = tsa[i];
        Rank[sa[1]] = 1;
        for (int i = 2; i <= n; i++) {
            Rank[sa[i]] = Rank[sa[i - 1]];
            if (A[sa[i]] != A[sa[i - 1]] || B[sa[i]] != B[sa[i - 1]]) Rank[sa[i]]++;
        }
    }
    for (int i = 1, j = 0; i <= n; i++) {
        if (j) j--;
        while (ch[i + j - 1] == ch[sa[Rank[i] - 1] + j - 1]) j++;
        height[Rank[i]] = j;
    }
}
int main() {
    freopen("a.txt","r",stdin);
    ios::sync_with_stdio(0);
    int T;
    cin>>T;
    while(T--) {
        cin>>s;
        n = strlen(s);
        get_SA(s);
        int ans = 0;
        height[1] = 0;
        for(int j = 1; j <= n; j++)
            ans += n-sa[j]+1-height[j];
        cout<<ans<<endl;
    }
    return 0;
}