CodeForces 123D String （后缀自动机）

题意：求字符串的所有不同子串的贡献和，子串的贡献为$n\ast (1+n)/2$，$n$为子串的个数。

题解：后缀自动机 （sa也可，用单调栈，插个眼后面补
跑拓扑建立topsam，自底向上更新。
$num[]$：sam中一个状态（$topsam[i]$）所表示的子串出现次数。
状态所表示个数：(p->fa->len,p->len]

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#define ll long long
using namespace std;
const int CHAR = 26;
const int MAXN = 2e5 + 5;
struct SAM_Node {
    SAM_Node* fa, * next[CHAR];
    int len;
    int id, pos;
    SAM_Node() {}
    SAM_Node(int _len) {
        fa = 0;
        len = _len;
        memset(next, 0, sizeof(next));
    }
};
SAM_Node SAM_node[MAXN * 2], * SAM_root, * SAM_last;
int SAM_size;
int topcnt[MAXN];// 拓扑排序使用
SAM_Node * topsam[MAXN * 2];
SAM_Node* newSAM_Node(int len) {
    SAM_node[SAM_size] = SAM_Node(len);
    SAM_node[SAM_size].id = SAM_size;
    return &SAM_node[SAM_size++];
}
SAM_Node* newSAM_Node(SAM_Node* p) {
    SAM_node[SAM_size] = *p;
    SAM_node[SAM_size].id = SAM_size;
    return &SAM_node[SAM_size++];
}
void SAM_init() {
    SAM_size = 0;
    SAM_root = SAM_last = newSAM_Node(0);
    SAM_node[0].pos = 0;
}
void SAM_add(int x, int len) {  //len从1开始
    SAM_Node* p = SAM_last, * np = newSAM_Node(p->len + 1);
    np->pos = len;
    SAM_last = np;
    for (; p && !p->next[x]; p = p->fa)
        p->next[x] = np;
    if (!p) {
        np->fa = SAM_root;
        return;
    }
    SAM_Node* q = p->next[x];
    if (q->len == p->len + 1) {
        np->fa = q;
        return;
    }
    SAM_Node* nq = newSAM_Node(q);
    nq->len = p->len + 1;
    q->fa = nq;
    np->fa = nq;
    for (; p && p->next[x] == q; p = p->fa) p->next[x] = nq;
}
int num[MAXN];
void SAM_build(char* s) {
    SAM_init();
    int len = strlen(s);
    for (int i = 0; i < len; i++) num[SAM_size] = 1, SAM_add(s[i] - 'a', i + 1);
}
void topo() {
    memset(topcnt, 0, sizeof(topcnt));
    for (int i = 0; i <= SAM_size; i++) topcnt[SAM_node[i].len]++;
    for (int i = 1; i <= SAM_size; i++) topcnt[i] += topcnt[i-1];
    for (int i = 0; i <= SAM_size; i++) topsam[--topcnt[SAM_node[i].len]] = &SAM_node[i];
}
char s[MAXN];
int main() {
    scanf("%s", s);
    SAM_build(s);
    topo();
    for (int i = SAM_size; i >= 2; i--) {
        num[topsam[i]->fa->id] += num[topsam[i]->id];
    }
    ll ans = 0;
    for (int i = SAM_size; i >= 2; i--) {
        ans += 1ll * num[topsam[i]->id] * (1 + num[topsam[i]->id]) / 2 * (topsam[i]->len - topsam[i]->fa->len);
    }
    printf("%lld\n", ans);
    return 0;
}