SPOJ SUBST1 不相同子串个数

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

题意：给你一个字符串，求不相同的子串的个数

思路：因为每个子串都一定是某个后缀的前缀，那么问题就可以转换成求所有后缀间不相同的子串的个数，而我们的height数组记录的是两个相邻后缀数组的最长公共前缀，所以我们用总数n*(n+1)/2 - height[i]的和就是答案

AC代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 50005;
int sa[maxn], t1[maxn], t2[maxn], c[maxn];
int ranks[maxn], height[maxn];

void build_sa(int s[], int n, int m)
{
    int i, j, p, *x = t1, *y = t2;
    for (i = 0; i < m; ++i) c[i] = 0;
    for (i = 0; i < n; ++i) c[x[i] = s[i]]++;
    for (i = 1; i < m; ++i) c[i] += c[i-1];
    for (i = n-1; i >= 0; i--)  sa[--c[x[i]]] = i;
    for (j = 1; j <= n; j <<= 1) {
        p = 0;
        for (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 < m; ++i) c[i] = 0;
        for (i = 0; i < n; ++i) c[x[y[i]]]++;
        for (i = 1; i < m; ++i) c[i] += c[i-1];
        for (i = n-1; i >= 0; i--)  sa[--c[x[y[i]]]] = y[i];
        swap(x, y);
        p = 1;
        x[sa[0]] = 0;
        for (i = 1; i < n; ++i)
            x[sa[i]] = y[sa[i-1]] == y[sa[i]] && y[sa[i-1]+j] == y[sa[i]+j] ? p-1 : p++;
        if(p >= n)  break;
        m = p;
    }
}

void getHeight(int s[], int n)
{
    int i, j, k = 0;
    for (i = 0; i <= n; ++i)    ranks[sa[i]] = i;
    for (i = 0; i < n; ++i) {
        if(k)   k--;
        j = sa[ranks[i]-1];
        while (s[i+k] == s[j+k])    k++;
        height[ranks[i]] = k;
    }
}

bool check(int n, int k, int t)
{
    int num = 1;
    for (int i = 2; i <= n; ++i) {
        if(height[i] >= t){
            num++;
            if(num >= k) return true;
        }
        else    num = 1;
    }
    return false;
}

int s[maxn];
int main()
{
    int T;
    char str[maxn];
    cin >> T;
    while (T--) {
        scanf("%s", str);
        int n = strlen(str);
        for (int i = 0; i <= n; ++i) {
            s[i] = str[i];
        }
        build_sa(s, n+1, 128);
        getHeight(s, n);
        long long ans = (long long)n*(n+1) / 2;
        for (int i = 2; i <= n; ++i) {
            ans -= height[i];
        }
        cout << ans << '\n';
    }
    return 0;
}