亚洲二区视频,欧美一级午夜免费电影,欧美影院一区

re: HDU 2896 病毒侵袭

��尼�?0 — Sat, 14 May 2011 05:04:00 GMT

#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

#define kind 129
#define M 10010

struct node {
node *fail;
node *next[kind];
int id;
node() { //构造函�?
fail = NULL;
id = 0;
memset(next, NULL, sizeof(next));
}
};

char ch[M]; //键盘输入的串
queue q;
set g;
int n, m;

void insert(node *root, char *str, int num) {
node *p = root;
int i = 0, index;
while(str[i]) {
index = str[i] - 'a';
if(p->next[index] == NULL) {
p->next[index] = new node();
}
p = p->next[index];
i++;
}
p->id = num;
}

void AC (node *&root) { ///root -> fail = NULL;
q.push(root);
while(!q.empty()) {
node *p = NULL;
node *t = q.front();
q.pop();
for(int i = 0; i < kind; i++) {

if(t->next[i]) {

p = t->fail;

while(p) {
if(p->next[i]) {
t->next[i]->fail = p->next[i];
break;
}
p = p->fail;
}
if(!p) t->next[i]->fail = NULL;
q.push(t->next[i]);
}
}
}
}

bool query(node *&root, char *str, int ca) {
g.clear();
int i = 0, t, flag = 0;
node *p = root, *tmp;
while(str[i]) {
t = str[i] - 'a';
while(!p->next[t] && p != root) { p = p->fail; }
///*****************************///
p = p->next[t];
///******************************///
if(!p) p = root;
tmp = p;
while(tmp != root && tmp->id) {
flag = 1;
g.insert(tmp->id);
tmp = tmp->fail;
}
i++;
}
if(!flag) return false;
printf("web %d:", ca);
for(set::iterator it = g.begin(); it != g.end(); it++) {
cout << ' ' << *it;
}
cout << endl;
return true;
}

int main() {
int total;
while(~scanf("%d", &n)) {
node *root = new node();
total = 0;
for(int i = 0; i < n; i++) {
scanf("%s", ch);
insert(root, ch, i+1);
}
AC(root);
cin >> n;
for(int i = 0; i < n; i++) {
cin >> ch;
if(query(root, ch, i+1)); total++;
}
printf("total: %d\n", total);
}
return 0;
}

帮忙看看吧！��g��Q�照你的写的�Q�但是还是不行，输入都不�?img src ="http://www.shnenglu.com/syhd142/aggbug/146361.html" width = "1" height = "1" />

��尼�?0 2011-05-14 13:04 发表评论

re: UVA 624 CD

Fucker — Thu, 31 Mar 2011 06:32:00 GMT

@alien
额，有点遥远了，都忘��C��?img src ="http://www.shnenglu.com/syhd142/aggbug/143110.html" width = "1" height = "1" />

Fucker 2011-03-31 14:32 发表评论

re: UVA 624 CD

alien — Thu, 31 Mar 2011 05:57:00 GMT

最后一�l�数据好像通不�q��?br>45 8 4 10 44 43 12 9 8 2
�q�组我用你的�E�序计算出来的是43 2 sum:45.
应该�? 10 12 9 8 2 sum:45
��Z��么可以这栯��录�\径？

alien 2011-03-31 13:57 发表评论

re: UVA 11594 All Pairs Maximum Flow

Ziwen — Sat, 12 Feb 2011 03:29:00 GMT

能不能把论文�l�我发一�?br>THX
Very Simple Methods for All Pairs Network Flow Analysis
caocao9926@163.com

Ziwen 2011-02-12 11:29 发表评论

re: UVA 10003 Cutting Sticks

jerrymu1234 — Wed, 17 Nov 2010 06:01:00 GMT

��h��g��Q?

如何在求minimum cost值的同时�Q?
记录所cut的点的次�??被困扰好久。。。。�?

比如input:
10 (木棍�?
3 �Q�切3�ơ）
2 4 7 �Q�在2�Q?�Q?处切�Q?
Output:
The minimum cost is 20.
The optimal cutting sequence: 4,2,7

jerrymu1234 2010-11-17 14:01 发表评论

re: UVA 10819 Trouble of 13-Dots

Fucker — Sat, 13 Nov 2010 16:26:00 GMT

@�?br>背包九讲里面貌似有说�?img src ="http://www.shnenglu.com/syhd142/aggbug/133560.html" width = "1" height = "1" />

Fucker 2010-11-14 00:26 发表评论