hdu 2896 病毒侵袭

算是AC自动机水题吧。

找到哪几个网站带病毒，跟上个题不同的时候，算过的id 不可以赋值为-1 = =。。。因为下面的网站还要匹配呢。

空格到底算不算可见字符捏？？？经测试，这个输入没有字符串中间带空格的。。。T T。。

然后sort，unique去重即可。。

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <limits.h>
#include <string.h>
#include <string>
#include <algorithm>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!")
#define STOP system("pause")

using namespace std;

const int MAX_N = 130;

struct NODE{
	int id;
	NODE *next[MAX_N], *fail;
	NODE()
	{
		id = 0;
		fail = NULL;
		memset(next, 0, sizeof(next));
	}
}*head;

void Build_trie(char *s,NODE *head,int id)
{
	int len = strlen(s);
	for(int i=0; i<len; i++)
	{
		int k = s[i];
		if( head->next[k] == NULL )
			head->next[k] = new NODE();
		head = head->next[k];
	}
	head->id = id;
}

queue<NODE*> q;
void Build_fail(NODE *head)
{
	head->fail = NULL;
	q.push(head);
	while( !q.empty() )
	{
		NODE *now = q.front(); q.pop();
		for(int i=0; i<MAX_N; i++)
			if( now->next[i] )
			{
				NODE *p = now->fail;
				while( p )
				{
					if( p->next[i] )
					{
						now->next[i]->fail = p->next[i];
						break;
					}
					p = p->fail;
				}
				if( p == NULL )
					now->next[i]->fail = head;
				q.push(now->next[i]);
			}
						
	}
}
int out[510];
int cnt;
void AC_find(NODE *head, char *s)
{
	int len = strlen(s) ;
	cnt = 0;
	NODE* p = head;
	for(int i=0; i<len; i++)
	{
		int k = s[i];
		while( p->next[k] == NULL && p != head )
			p = p->fail;
		p = p->next[k] == NULL ? head : p->next[k];
		
		NODE *tmp = p;
		while( tmp != head )
		{
			if( tmp->id )
				out[cnt++] = tmp->id;
			tmp = tmp->fail;
		}
	}
}

char s[10010];
char ss[210];
int main()
{
	int n, m;

	while( ~scanf("%d", &n) )
	{
		head = new NODE();		
		for(int i=1; i<=n; i++)
		{
			scanf("%s",ss);
			Build_trie(ss, head, i);
		}
		
		Build_fail( head );
		
		scanf("%d", &m);
		int sum = 0;
		for(int i=1; i<=m; i++)
		{
			scanf("%s",s);
			AC_find( head, s);
			if( cnt )
			{
				printf("web %d:",i);
				sort(out, out+cnt);
				cnt = unique(out, out+cnt) - out;
				for(int k=0; k<cnt; k++)
					printf(" %d",out[k]);
				printf("\n");
				sum++;
			}
		}
		printf("total: %d\n", sum);
	}

return 0;
}