后缀自动机二·重复旋律5

后缀自动机二·重复旋律5

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000010;
char s[maxn];
int maxlen[maxn<<1], minlen[maxn<<1], tr[maxn<<1][26], link[maxn<<1];
int sz;

int news(int maxl, int minl, int *trans, int lk){
    maxlen[sz] = maxl;
    minlen[sz] = minl;
    for(int i = 0; i < 26; i++){
        if(trans == NULL) tr[sz][i] = -1;
        else tr[sz][i] = trans[i];
    }
    link[sz] = lk;
    return sz++;
}
int add(char ch, int u){
    int c = ch - 'a';
    int z = news(maxlen[u] + 1, -1, NULL, -1);
    int v = u;
    while(~v && tr[v][c] == -1){
        tr[v][c] = z;
        v = link[v];
    }
    if(v == -1){
        minlen[z] = 1;
        link[z] = 0;
        return z;
    }
    int x = tr[v][c];
    if(maxlen[v] + 1 == maxlen[x]){
        minlen[z] = maxlen[x] + 1;
        link[z] = x;
        return z;
    }
    int y = news(maxlen[v] + 1, -1, tr[x], link[x]);
    minlen[x] = maxlen[y] + 1;
    link[x] = y;
    minlen[z] = maxlen[y] + 1;
    link[z] = y;
    int w = v;
    while(~w && tr[w][c] == x){
        tr[w][c] = y;
        w = link[w];
    }
    minlen[y] = maxlen[link[y]] + 1;
    return z;
}

int main(){
    while(scanf("%s", s) != EOF){
        int len = strlen(s);
        sz = 0;
        int pre = news(0, 0, NULL, -1);
        for(int i = 0; i < len; i++){
            pre = add(s[i], pre);
        }
        long long ans = 0;
        for(int i = 1; i < sz; i++) ans += maxlen[i] - minlen[i] + 1;
        printf("%lld
", ans);
    }
}

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000010;
int len[maxn<<1], tr[maxn<<1][26], link[maxn<<1];
int sz, last;
long long ans;
void init(){
    sz = last = 0;
    len[0] = 0, link[0] = -1;
    memset(tr, -1, sizeof tr);
    ++sz;
}
void sa(int c){
    c = c - 'a';
    int cur = sz++;
    len[cur] = len[last] + 1;
    int p;
    for(p = last; ~p && tr[p][c] == -1; p = link[p]){
        tr[p][c] = cur;
    }
    if(p == -1) link[cur] = 0;
    else{
        int q = tr[p][c];
        if(len[p] + 1 == len[q]) link[cur] = q;
        else{
            int co = sz++;
            len[co] = len[p] + 1;
            for(int i = 0; i < 26; i++) tr[co][i] = tr[q][i];
            link[co] = link[q];
            for(; ~p && tr[p][c] == q; p = link[p]) tr[p][c] = co;
            link[q] = link[cur] = co;
        }
    }
    last = cur;
    ans += len[cur] - len[link[cur]];
}
char s[maxn];
//long long solve(int u){
//    if(u == -1) return 0;
//    long long temp = 0;
//    for(int i = 0; i < 26; i++){
//        temp += solve(tr[u][i]);
//    }
//    return temp + 1;
//}
int main(){
    while(scanf("%s", s) != EOF){
        init();
        ans = 0;
        int len = strlen(s);
        for(int i = 0; i < len; i++) sa(s[i]);
        //ans = solve(0);
        printf("%lld
", ans);
    }
}