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

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 11000
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,cnt[160],son
[26],v
,owo,rt=1,fail
,pre
;
char s[1000010],a[160][100];
inline void ins(char *s,int id){
int len=strlen(s+1),p=rt;
for(int i=1;i<=len;++i){
int to=s[i]-'a';
if(!son[p][to]) son[p][to]=++owo;p=son[p][to];
}v[p]=id;
}
inline void buildAC(){
queue<int>q;q.push(rt);
while(!q.empty()){
int x=q.front();q.pop();
for(int i=0;i<26;++i){
int &y=son[x][i],k=fail[x];
if(!y){y=son[k][i];continue;}q.push(y);
fail[y]=son[k][i];pre[y]=v[fail[y]]?fail[y]:pre[fail[y]];
}
}
}
inline void gao(char *s){
int m=strlen(s+1),p=rt;
for(int i=1;i<=m;++i){
p=son[p][s[i]-'a'];
for(int t=p;t;t=pre[t]) cnt[v[t]]++;
}
}
int main(){
//  freopen("a.in","r",stdin);
while(1){
n=read();if(!n) break;
memset(son,0,sizeof(son));memset(v,0,sizeof(v));
memset(fail,0,sizeof(fail));memset(pre,0,sizeof(pre));
memset(cnt,0,sizeof(cnt));owo=1;
for(int i=1;i<=n;++i) scanf("%s",a[i]+1),ins(a[i],i);
for(int i=0;i<26;++i) son[0][i]=rt;
buildAC();scanf("%s",s+1);gao(s);int ans=0;
for(int i=1;i<=n;++i) ans=max(ans,cnt[i]);printf("%d\n",ans);
for(int i=1;i<=n;++i) if(cnt[i]==ans) puts(a[i]+1);
}return 0;
}