摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2222AC自动机View Code #include <stdio.h>#include <string.h>const int N=250010,B=26;int trie[N][26];int fail[N];int key[N];int size;int que[N];char s[1000100];void insert(char *s){ int p=0,i; for (i=0;s[i];i++) { int c=s[i]-'a'; if (!trie[... 阅读全文