P3804 【模板】后缀自动机

 思路：right 集合出现的次数的求法是将所有节点的按照len进行排序，并且将所有包含前缀的节点的 sz 置为1.最后按照len从大到小的顺序 执行 sz[ fa[x] ] += sz[x] 的操作。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
const int maxm = 2000005;
int righ[2*maxn];
const int ch_size = 26;
struct SAM{
    int fa[maxn*2],    // 后缀链接
            ch[maxn*2][ch_size],
            len[maxn*2],   //该节点最长串的长度
            tot,    // 节点总数
            last;  // 代表当前的整个串
    void init(){
        tot = last = 0;
        fa[0] = -1;
        len[0] = 0;
        memset( ch[0],0,sizeof( ch[0] ) );
    }
    void extend( int x ){
        int p = last;
        int cur = ++tot;
        memset( ch[cur],0,sizeof( ch[cur] ) );
        len[cur] = len[last]+1;
        while( p != -1 && !ch[p][x] ){
            ch[p][x] = cur;
            p  = fa[p];
        }
        if( p == -1 ){
            fa[cur] = 0;
        }else {
            int q = ch[p][x];
            if (len[q] == len[p] + 1) {
                fa[cur] = q;
            } else {
                int clone = ++tot;
                len[clone] = len[p] + 1;
                for (int i = 0; i < ch_size; i++) {
                    ch[clone][i] = ch[q][i];
                }
                fa[clone] = fa[q];
                fa[q] = fa[cur] = clone;
                while (p != -1) {
                    if (ch[p][x] == q)ch[p][x] = clone;
                    else break;
                    p = fa[p];
                }
            }
        }
        last = cur;
    }
    int ver[maxm],he[maxn*2],tot1,ne[maxm];
}g;
char str[maxn];
int c[maxn],b[maxn<<1];
void radix( int len ){
    memset( c,0,sizeof(c) );
    for( int i = 1;i <= g.tot;i++ ) c[ g.len[i] ]++;
    for( int i = 2;i <= len;i++ ) c[i] += c[i-1];
    for( int i = 1;i <= g.tot;i++ ) b[c[ g.len[i] ]--] = i;
}
int main(){
    scanf("%s",str);
    g.init();
    int len = strlen(str);
    for( int i = 0;i < len;i++ ){
        g.extend( str[i]-'a' );
    }
    radix(len);
    int p = 0;
    for( int i = 0;i < len;i++ ){
        p = g.ch[p][ str[i]-'a' ];
        righ[p] = 1;
    }
    for( int i = g.tot;i >= 1;i-- ){
        int j = b[i];
        righ[ g.fa[j] ] += righ[j];
    }
    long long ans = 0;
    for( int i = 1;i<= g.tot;i++ ){
        if( righ[i] > 1 ){
            ans = max( ans,(long long)righ[i]*g.len[i] );
        }
    }
    cout << ans;
    return 0;
};