hdu 2896 病毒侵袭

代码：

#include <queue>
#include <cstdio>        
#include <cstring>    
#include <iostream>    
#include <algorithm>

using namespace std;

const int SIZE = 128;
const int MAX = 200 * 500 + 10;

struct Trie{
	int next[MAX][SIZE],end[MAX],fail[MAX];
	int root, L;
	int newnode(){
		for(int i=0; i<SIZE; i++)
			next[L][i] = -1;
		end[L++] = -1;
		return L - 1;
	}
	
	void init(){
		L = 0;
		root = newnode();
	}
	
	void insert(char buf[], int id){
		int len = strlen(buf), now = root;
		for(int i=0; i<len; i++){
			if(next[now][buf[i]] == -1)
				next[now][buf[i]] = newnode();
			now = next[now][buf[i]];
		}
		end[now] = id;
	}
	
	void build(){
		queue <int> Q;
		fail[root] = root;//
		for(int i=0; i<SIZE; i++){
			if(next[root][i] == -1) 
				next[root][i] = root;
			else{
				fail[next[root][i]] = root;
				Q.push(next[root][i]);
			}
		}
		while(!Q.empty()){
			int now = Q.front();
			Q.pop();
			for(int i=0; i<SIZE; i++){
				if(next[now][i] == -1)
					next[now][i] = next[fail[now]][i];
				else{
					fail[next[now][i]] = next[fail[now]][i];
					Q.push(next[now][i]);
				}
			}
		}
	}
	
	bool vis[510];
	bool query(char buf[], int id, int n){
		int len = strlen(buf), now = root;
		memset(vis, false, sizeof(vis));
		bool flag = false;
		for(int i=0; i<len; i++){
			now = next[now][buf[i]];
			int temp = now;
			while(temp != root){
				if(end[temp] != -1){
					vis[end[temp]] = true;
					flag = true;
				}	
				temp = fail[temp];
			}
		}
		if(!flag) return false;
		printf("web %d:",id);
		for(int i=1; i<=n; i++)
			if(vis[i]) printf(" %d",i);
		printf("\n");
		return true;
	}
};

Trie AC;
char buf[10010];
int main(){
	int n,m;
	AC.init();
	scanf("%d",&n);
	for(int i=1; i<=n; i++){
		scanf("%s",buf);
		AC.insert(buf, i);
	}
	AC.build();
	scanf("%d",&m);
	int ans = 0;
	for(int i=1; i<=m; i++){
		scanf("%s", buf);
		if(AC.query(buf, i, n)) ans++;
	}
	printf("total: %d\n",ans);
	return 0;
}