【模板】AC自动机

可在洛谷提交

---

简单版

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int N=1e6+10;
int n,ch[N][26],cur[N],f[N],cnt,ans;
char s[N];
queue<int>Q;
int main(){
	register int i,j,k,alp,kmp,u;
	scanf("%d",&n);
	while(n--){
		scanf("%s",s);k=strlen(s);u=0;
		for(i=0;i<k;++i){
			alp=s[i]-'a';
			if(!ch[u][alp]) ch[u][alp]=++cnt;
			u=ch[u][alp];
		}
		cur[u]++;
	}
    for(i=0;i<26;++i) if(ch[0][i]) Q.push(ch[0][i]);
    while(!Q.empty()){
    	k=Q.front();Q.pop();kmp=f[k];
    	for(i=0;i<26;++i) 
		if(ch[k][i]){f[ch[k][i]]=ch[kmp][i];Q.push(ch[k][i]);}
		else ch[k][i]=ch[kmp][i];
    }
    scanf("%s",s);
    k=strlen(s);kmp=0;
    for(i=0;i<k;++i){
    	kmp=ch[kmp][s[i]-'a'];
    	for(j=kmp;j&&cur[j]!=-1;j=f[j]){
    		ans+=cur[j];cur[j]=-1;
    	}
    }
    printf("%d\n",ans);
}

---

加强版

#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int N=1e6+10,M=15000;
int n,cnt,ch[M][26],ed[155],b[155],f[M],cur[M];
char s[N],t[155][75];
queue<int>Q;
inline bool cmp(const int&x,const int&y){
  return cur[ed[x]]==cur[ed[y]]?x<y:cur[ed[x]]>cur[ed[y]];
}
int main(){
	register int i,j,k,alp,u,kmp;
	while(scanf("%d",&n)==1){
		if(!n) break;
		for(i=0;i<=cnt;++i){
		  cur[i]=0;
		  for(j=0;j<26;++j) ch[i][j]=0;	
		} 
		cnt=0;
		for(i=1;i<=n;++i){
			b[i]=i;
			scanf("%s",t[i]);
		    k=strlen(t[i]);u=0;
		    for(j=0;j<k;++j){
			   alp=t[i][j]-'a';
			   if(!ch[u][alp]) ch[u][alp]=++cnt;
			   u=ch[u][alp];
			} 
			ed[i]=u;
		}f[0]=0;
		for(i=0;i<26;++i) if(ch[0][i]) {f[ch[0][i]]=0;Q.push(ch[0][i]);}
		while(!Q.empty()){
			u=Q.front();Q.pop();kmp=f[u];
			for(i=0;i<26;++i)
			 if(ch[u][i]){f[ch[u][i]]=ch[kmp][i];Q.push(ch[u][i]);}
			 else ch[u][i]=ch[kmp][i];
		}
		scanf("%s",s);
		k=strlen(s);kmp=0;
		for(i=0;i<k;++i){
			kmp=ch[kmp][s[i]-'a'];
			for(j=kmp;j;j=f[j]) cur[j]++;
		}
		sort(b+1,b+n+1,cmp);
		printf("%d\n%s\n",cur[ed[b[1]]],t[b[1]]);
		for(i=2;cur[ed[b[i]]]==cur[ed[b[i-1]]]&&i<=n;++i) 
		 printf("%s\n",t[b[i]]);
	}
}