bzoj 2780 （查询一个字符串在多少个主串中出现过）

题意：查询一个字符串在多少个主串中出现过。

重点：我试过了两种在线的做法，都不可以，所以说广义后缀自动机别在线维护。

#include <bits/stdc++.h>
using namespace std;
const int maxn =360005;
const int ch_size = 26;
struct SAM{
    int fa[maxn<<1],    // 后缀链接
            ch[maxn<<1][ch_size],
            len[maxn<<1],   //该节点最长串的长度
            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;
        if( ch[p][x] ){
            int q = ch[p][x];
            if( len[q] == len[p]+1 ) last = q;
            else{
                int clone = ++tot;
                len[clone] = len[p] + 1;
                last = clone;
                for (int i = 0; i < ch_size; i++) {
                    ch[clone][i] = ch[q][i];
                }
                fa[clone] = fa[q];
                fa[q]  = clone;
                while (p != -1) {
                    if (ch[p][x] == q)ch[p][x] = clone;
                    else break;
                    p = fa[p];
                }
            }
            return;
        }
        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;
    }
}g;
string str[maxn];
int vis[maxn<<1],tim,righ[maxn<<1];
void solve( int x ){
    while( x && vis[x] != tim ){
        vis[x] = tim;
        righ[x]++;
        x = g.fa[x];
    }
}
char ss[maxn];
int main(){
    g.init();
    int n,q;
    //scanf("%d%d",&n,&q);
    scanf("%d%d",&n,&q);
    for( int i = 1;i <= n;i++ ){
        scanf("%s",ss);
        str[i] = string(ss);
        g.last = 0;
        int len = strlen(ss);
        for( int j = 0;j < len;j++ ){
            g.extend( ss[j]-'a' );
        }
    }
    for( int i = 1;i <= n;i++ ){
        int p = 0;tim++;
        int len = str[i].size();
        for( int j = 0;j < len;j++ ){
            p = g.ch[p][str[i][j]-'a' ];
            solve( p );
        }
    }
    for( int i = 1;i <= q;i++ ){
        scanf("%s",ss);
        int len = strlen(ss),p = 0;
        for( int j = 0;j < len;j++ ){
            int c =  ss[j]-'a' ;
            if( g.ch[p][c] ) {
                p = g.ch[p][c];
            }else{
                p = 0;break;
            }
        }
        int ans;
        if(p) {
            ans =  righ[p];
        }
        else ans = 0;
        //printf("%d\n",ans);
        printf("%d\n",ans);
    }
    return 0;
}