LuoGu P3796 Aho Corasick Automaton

这个做法其实有问题的，能过是因为给的数据范围有点怪，完全可以加强数据范围卡掉

最好的做法是在find时在fail树上打标记，最后bfs

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6;
int ans[N];
struct Aho_Corasick_Automaton {
    int ch[N][26], f[N], val[N], sz, rt;
    int newnode() { memset(ch[sz], -1, sizeof(ch[sz])), val[sz] = 0; return sz++; }
    void init() { sz = 0, rt = newnode(); }
    inline int idx(char c) { return c - 'a'; };
    void insert(const char* s,int pos) {
        int u = 0;
        for (int i = 0; s[i]; i++) {
            int c = idx(s[i]);
            if (ch[u][c] == -1) ch[u][c] = newnode();
            u = ch[u][c];
        }
        val[u]=pos;
    }
    void build() {
        queue<int> q; f[rt] = rt;
        for (int c = 0; c < 26; c++) {
            if (~ch[rt][c])f[ch[rt][c]] = rt, q.push(ch[rt][c]);
            else ch[rt][c] = rt;
        }
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int c = 0; c < 26; c++) {
                if (~ch[u][c]) f[ch[u][c]] = ch[f[u]][c], q.push(ch[u][c]);
                else ch[u][c] = ch[f[u]][c];
            }
        }
    }
    int query(const char* s) {
        int u = rt, res = 0;
        for (int i = 0; s[i]; i++) {
            int c = idx(s[i]); u = ch[u][c];
            for(int tmp=u;tmp;tmp=f[tmp]){
                if(val[tmp])ans[val[tmp]]++,res=max(res,ans[val[tmp]]);
            }
        }
        return res;
    }
} aca;
char s[200][200];
char t[N];
int main(){
    int n;while(cin>>n&&n){
        aca.init();memset(ans,0,sizeof ans);
        for(int i=1;i<=n;++i)scanf("%s",s[i]),aca.insert(s[i],i);
        aca.build();scanf("%s",t);int Ans=aca.query(t);
        cout<<Ans<<endl;for(int i=1;i<=n;++i)if(Ans==ans[i])cout<<s[i]<<endl;
    }
}