AC自动机模板+例题（HDU2896+HDU3065+HDU2222）

病毒侵袭中（HDU2896）

#include

病毒持续侵袭中（HDU3065）

#include

KeyWord Search(HDU2222)

#include
#include
#include
#include
#include
using namespace std;
const int MaxN = 1e4 *50;

int n;
char s[1000000];
int trie[MaxN + 4][30];
int word[MaxN + 5];
int fail[MaxN + 5];
char ss[1000005];
int tot;

void insert(){
	int root = 0;
	int Len = strlen(s);
	for(int i = 0; i < Len; i++){
		if(trie[root][s[i] - 'a'] == 0){
			trie[root][s[i] - 'a'] = ++tot;
		}
		root = trie[root][s[i] - 'a'];
	}
	word[root]++;
}

void GetNxt(){
	queue q;
	for(int i = 0; i < 26; i++){
		if(trie[0][i]){
			fail[trie[0][i]] = 0;
			q.push(trie[0][i]);
		}
	}
	while(!q.empty()){
		int now = q.front();
		q.pop();
		for(int i = 0; i < 26; i++){
			if(trie[now][i]){
				fail[trie[now][i]] = trie[fail[now]][i];
				q.push(trie[now][i]);
			}
			else trie[now][i] = trie[fail[now]][i];
		}
	}	
}

int Query(){
	int now, ans, Len;
	ans = now = 0;
	Len = strlen(ss);
	for(int i = 0; i < Len; i++){
		now = trie[now][ss[i] - 'a'];
		for(int j = now; j != 0 && word[j] != -1; j = fail[j]){
			ans += word[j];
			word[j] = -1;
		}
	}
	return ans;
}

int main(){
	int t; cin >> t;
	while(t--){
		scanf("%d", &n);
		tot = 0;
		memset(word, 0, sizeof word);
		memset(trie, 0, sizeof trie);
		memset(fail, 0, sizeof fail);
		for(int i = 1; i <= n; i++){
			scanf("%s", s);
			insert();
		}
		fail[0] = 0;
		GetNxt();
		scanf("%s", ss);
		int ans = Query();
		printf("%d\n", ans);
	}
	return 0;
}

hdu2222卡cin cout超时