luogu P3796 【模板】AC自动机（加强版）

知识点：1.一定要删掉调试信息

　　　　　　　2.数组别重名

code：

#include <bits/stdc++.h>
using namespace std;
int n;
int len[];
char c[];
char a[][];
int ans[];
struct ACtree
{
    int cnt;
    int f[],sfaf[];
     int ch[][],val[];
     void init()
     {
         cnt = ;
         memset(f,,sizeof(f));
         memset(sfaf,,sizeof(sfaf));
         memset(ch,,sizeof(ch));
         memset(val,,sizeof(val));
     }
     void insert(int t)
     {
         int u = ;
         len[t] = strlen(a[t]);
         for(int i = ;i < len[t];i++)
         {
             int k = a[t][i] - 'a';
             if(!ch[u][k])
             {
                 ch[u][k] = ++cnt;
                 u = ch[u][k];
             }
             else u = ch[u][k];
         }
         val[u] = t;
     }
     void getfail()
     {
         queue <int> q;
         q.push();
         while(!q.empty())
         {
             int u = q.front();
             q.pop();
             for(int i = ;i < ;i++)
             {
                 int v = ch[u][i];
                 if(!v){ch[u][i] = ch[f[u]][i];continue;}
                 q.push(v);
                 f[v] = u?ch[f[u]][i]:;
                 sfaf[v] = val[f[v]]?f[v]:sfaf[f[v]];
             }
         }
     }
     void work()
     {
         int u = ;
         int lena = strlen(c);
         for(int i = ;i < lena;i++)
         {
             int k = c[i] - 'a';
             u = ch[u][k];
             if(val[u])
             {
                 ans[val[u]]++;
             }
             int v = u;
             while(sfaf[v])
             {
                 v = sfaf[v];
                 if(val[v])
                 {
                     ans[val[v]]++;
                 }
             }
         }
     }
}ac;
int main()
{//freopen("in.in","r",stdin);
    while()
    {
        memset(ans,,sizeof(ans));
        scanf("%d",&n);
        if(!n)return ;
        for(int i = ;i <= n;i++)
        {
            scanf("%s",a[i]);
            ac.insert(i);
        }
        ac.getfail();
        scanf("%s",c);
        ac.work();
        int maxn = ;
        for(int i = ;i <= n;i++)
        {
            maxn = max(maxn,ans[i]);
        }
        printf("%d\n",maxn);
        for(int i = ;i <= n;i++)
        {
            if(ans[i] == maxn){for(int j = ;j < len[i];j++)printf("%c",a[i][j]);printf("\n");}
        }
        ac.init();
    }
    return ;
}