AC自动机+dp.docVIP

Pku3691DNA repair:给定m个病毒DNA片段，在给一个DNA序列，求最小经过多少次改动可以消去病毒序列。无法则输出-1. Pku2778DNA，也是给你m个病毒DNA片段，求长度为N的没有病毒序列的种数结果mod100000。 Pku1625，给定字母表E,在给你n个禁止出现子序列，求长度为M的序列有多少种，输出结果。高精度。 PKU3691 #includeiostream using namespace std; const int size = 1003; const int MAXINT = 130; int dp[size][size]; char word[24]; char str[size]; struct Node { int end,fail,son[4]; void Init() { end = 0; fail = -1; memset(son, -1, sizeof(son)); } }node[size]; int node_Num = 0; int q[size],head,tail; int Index(char a) { switch(a) { case A:return 0; case G:return 1; case C:return 2; case T:return 3; } } void Insert(char *s) { int p = 0; for(int i=0; s[i]; i++) { if (node[p].son[Index(s[i])] == -1) { node_Num++; node[p].son[Index(s[i])] = node_Num; node[node_Num].Init(); } if (node[p].end) break;/*危险结点为其子结点不必继续 */ p = node[p].son[Index(s[i])]; } node[p].end++; } void Build_Ac() { int temp, p, i; head = tail = 0; q[tail++] = 0; while (head tail) { temp = q[head++]; for (i = 0; i 4; i++) if (node[temp].son[i] != -1) { if (temp == 0) node[node[temp].son[i]].fail = 0; else { p = node[temp].fail; while (p != -1) { if (node[p].son[i] != -1) { node[node[temp].son[i]].fail = node[p].son[i]; /*无此句，wa！*/ if (node[node[p].son[i]].end) node[node[temp].son[i]].end++; break; } p = node[p].fail; } if (p == -1) node[node[temp].son[i]].fail = 0; } q[tail++] = node[temp].son[i]; } } } voi