AC自动机模板2

题目链接：https://www.luogu.org/problemnew/show/P3796

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <sstream>
#include <iostream>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
#define ll long long
#define re register
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define P pair<int,int>
const int N=1e6+;
const int mod=1e9+;
void read(int &a)
{
    a=;
    int d=;
    char ch;
    while(ch=getchar(),ch>''||ch<'')
        if(ch=='-')
            d=-;
    a=ch-'';
    while(ch=getchar(),ch>=''&&ch<='')
        a=a*+ch-'';
    a*=d;
}
void write(int x)
{
    if(x<)
        putchar(),x=-x;
    if(x>)
        write(x/);
    putchar(x%+'');
}
struct note
{
    int next;
    int to[];
    int bz;
}trie[N];
int tot;
struct node
{
    int sum,pos;
}ans[];
bool cmp(node x,node y)
{
    if(x.sum!=y.sum)
        return x.sum>y.sum;
    else
        return x.pos<y.pos;
}
string s[];
inline void clean(int x)
{
    trie[x].next=;
    trie[x].bz=;
    memset(trie[x].to,,sizeof(trie[x].to));
}
inline void ins(string s,int k)
{
    int len=s.length();
    int now=;
    for(re int i=;i<len;i++)
    {
        int x=s[i]-;
        if(!trie[now].to[x])
            trie[now].to[x]=++tot,clean(tot);
        now=trie[now].to[x];
    }
    trie[now].bz=k;
}
inline void built()
{
    queue <int> q;
    for(re int i=;i<=;i++)
        if(trie[].to[i])
            trie[trie[].to[i]].next=,q.push(trie[].to[i]);
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        for(re int i=;i<=;i++)
        {
            if(trie[p].to[i])
                trie[trie[p].to[i]].next=trie[trie[p].next].to[i],q.push(trie[p].to[i]);
            else
                trie[p].to[i]=trie[trie[p].next].to[i];
        }
    }
}
inline void solve(string s)
{
    int len=s.length();
    int now=;
    for(re int i=;i<len;i++)
    {
        int x=s[i]-;
        now=trie[now].to[x];
        for(re int t=now;t;t=trie[t].next)
            ans[trie[t].bz].sum++;
    }
}
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        tot=;
        clean();
        for(re int i=;i<=n;i++)
        {
            cin>>s[i];
            ans[i].sum=;
            ans[i].pos=i;
            ins(s[i],i);
        }
        trie[].next=;
        built();
        cin>>s[];
        solve(s[]);
        sort(ans+,ans++n,cmp);
        cout<<ans[].sum<<endl;
        cout<<s[ans[].pos]<<endl;
        for(re int i=;i<=n;i++)
        {
            if(ans[i].sum==ans[i-].sum)
                cout<<s[ans[i].pos]<<endl;
            else
                break;
        }
    }
    return ;
}