HDU 2896 病毒侵袭

#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 100005
char a[205];
char b[10005];
int ans[20];
int n, m;
int idx;
struct Trie {
Trie *fail;
Trie *son[128];
int ex;
};
Trie t
;
Trie *que
;
int ptr;
Trie *NewNode(){
Trie *p = &t[ptr++];
memset(p->son, NULL, sizeof(p->son));
p->fail = NULL;
p->ex = -1;
return p;
}
void Insert(int id, Trie *root){
Trie *tmp = root;
for(int i = 0; a[i]; i++){
if(tmp->son[a[i]] == NULL)
tmp->son[a[i]] = NewNode();
tmp = tmp->son[a[i]];
}
tmp->ex = id;
}
void gfail(Trie *root){
int head = 0, tail = 0;
que[tail++] = root;
Trie *tmp;
while(head < tail){
tmp = que[head++];
for(int i = 0; i < 128; i++){
if(tmp->son[i] != NULL){
Trie *next = tmp->fail;
while(next != NULL && next->son[i] == NULL){
next = next->fail;
}
if(next == NULL)
tmp->son[i]->fail = root;
else
tmp->son[i]->fail = next->son[i];
que[tail++] = tmp->son[i];
}
}
}
}
void AC(Trie *root){
Trie *tmp = root;
for(int i = 0; b[i]; i++){
while(tmp->son[b[i]] == NULL && tmp != root){
tmp = tmp->fail;
}
if(tmp->son[b[i]] == NULL)
tmp = root;
else
tmp = tmp->son[b[i]];
Trie *p = tmp;
while(p != root && p->ex != -1){
ans[idx++] = p->ex;
p = p->fail;
}
}
}
int main()
{
while(scanf("%d", &m) != EOF){
ptr = 0;
Trie *root = NewNode();
for(int i = 0; i < m; i++){
scanf("%s", a);
Insert(i, root);
}
gfail(root);
scanf("%d", &n);
int tot = 0;
for(int i = 0; i < n; i++){
idx = 0;
scanf("%s", b);
AC(root);
if(idx){
sort(ans, ans + idx);
printf("web %d: ", i + 1);
for(int i = 0; i < idx; i++){
printf("%d ", ans[i] + 1);
}
printf("\n");
tot ++;
}
}
printf("total: %d\n", tot);
}
return 0;
}