Distinct Substrings SPOJ - DISUBSTR(后缀数组水题)

时间：2023-01-29 00:03:32

求不重复的子串个数

用所有的减去height就好了 推出来的。。。

#include <iostream>

#include <cstdio>

#include <sstream>

#include <cstring>

#include <map>

#include <cctype>

#include <set>

#include <vector>

#include <stack>

#include <queue>

#include <algorithm>

#include <cmath>

#define rap(i, a, n) for(int i=a; i<=n; i++)

#define rep(i, a, n) for(int i=a; i<n; i++)

#define lap(i, a, n) for(int i=n; i>=a; i--)

#define lep(i, a, n) for(int i=n; i>a; i--)

#define rd(a) scanf("%d", &a)

#define rlld(a) scanf("%lld", &a)

#define rc(a) scanf("%c", &a)

#define rs(a) scanf("%s", a)

#define MOD 2018

#define LL long long

#define ULL unsigned long long

#define Pair pair<int, int>

#define mem(a, b) memset(a, b, sizeof(a))

#define _  ios_base::sync_with_stdio(0),cin.tie(0)

//freopen("1.txt", "r", stdin);

using namespace std;

const int maxn = , INF = 0x7fffffff;

char a[maxn];

int s[maxn];

int sa[maxn], t[maxn], t2[maxn], c[maxn], n;

int ran[maxn], height[maxn];

void get_sa(int m)

{

    int i, *x = t, *y = t2;

    for(i = ; i < m; i++) c[i] = ;

    for(i = ; i < n; i++) c[x[i] = s[i]]++;

    for(i = ; i < m; i++) c[i] += c[i-];

    for(i = n-; i >= ; i--) sa[--c[x[i]]] = i;

    for(int k = ; k <= n; k <<= )

    {

        int p = ;

        for(i = n-k; i < n; i++) y[p++] = i;

        for(i = ; i < n; i++) if(sa[i] >= k) y[p++] = sa[i] - k;

        for(i = ; i < m; i++) c[i] = ;

        for(i = ; i < n; i++) c[x[y[i]]]++;

        for(i = ; i< m; i++) c[i] += c[i-];

        for(i = n-; i >= ; i--) sa[--c[x[y[i]]]] = y[i];

        swap(x, y);

        p = ; x[sa[]] = ;

        for(i = ; i < n; i++)

            x[sa[i]] = y[sa[i-]] == y[sa[i]] && y[sa[i-]+k] == y[sa[i]+k] ? p- : p++;

        if(p >= n) break;

        m = p;

    }

    int k = ;

    for(i = ; i < n; i++) ran[sa[i]] = i;

    for(i = ; i < n; i++)

    {

        if(k) k--;

        int j = sa[ran[i]-];

        while(s[i+k] == s[j+k]) k++;

        height[ran[i]] = k;

    }

}

int main()

{

    int T;

    rd(T);

    while(T--)

    {

        rs(a);

        n = strlen(a);

        rep(i, , n)

            s[i] = a[i];

        int sum = n*(n+)/;

        s[n++] = ;

        get_sa();

        rep(i, , n)

            sum -= height[i];

        cout<< sum <<endl;

    }

    return ;

}

相关文章