【ac自动机·DP】poj3691 DNA Repair

这道题做得相当怀疑人生
先按照poj2778建树建图；
http://blog.csdn.net/nymph_h/article/details/77141849
接下来不用矩阵快速幂用DP
我对DP从来有莫名的恐惧

dp[文本串长度][Trie树节点数]；
母串的前I个前缀在TRIE树中遍历，达到某个安全节点j需要修改的最小值dp[I][j];

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<string>
#include<queue>
using namespace std;
const int maxk = 110;
const int maxn = 1010;
const int mod = 10009;
const int INF = 0x3fffffff;

int n;
int ch[maxn][maxn];
int val[maxn]; //这里做病毒节点标记
int sz;
int dp[maxn][maxn];
char t[maxn];

int idx(char c){
    if (c == 'A') return 0;
    if (c == 'G') return 1;
    if (c == 'C') return 2;
    if (c == 'T') return 3;
}

//构建tire树,常规
void insert(char *s){
    int u = 0, n = strlen(s);
    for (int i = 0; i < n; i++){
        int c = idx(s[i]);
        if (!ch[u][c]){
            memset(ch[sz], 0, sizeof(ch[sz]));
            val[sz] = 0;
            ch[u][c] = sz++;
        }
        u = ch[u][c];
    }
    val[u] = 1;
}

void init(){
    sz = 1;
    memset(ch[0], 0, sizeof(ch[0]));
    for (int i = 1; i <= n; i++){
        char tmp[22]; scanf("%s", tmp);
        insert(tmp);
    }
}
//trie树构建完毕

//构建AC自动机
int nex[maxn];  //失配数组

void getNext(){
    queue<int>q;
    nex[0] = 0;
    for (int c = 0; c < 4; c++){
        int u = ch[0][c];
        if (u) {
            q.push(u); nex[u] = 0;
        }
    }
    while (!q.empty()){
        int fg = 1;
        int r = q.front(); q.pop();
        for (int c = 0; c < 4; c++){
            int u = ch[r][c]; // r表示当前结点标号，u表示下一个节点的标号
            if (!u){
                ch[r][c] = ch[nex[r]][c]; //！如果当前节点子节点为空，让其指向失配节点子节点
                continue;
            }
            q.push(u);
            int v = nex[r];  //v是r的失配节点
            while (v && !ch[v][c]) v = nex[v];  //回溯到原点或者上一个相同字母的节点
            nex[u] = ch[v][c];
            if (val[nex[u]] == 1)   //！如果当前节点的失配节点是病毒点，当前也标为病毒点
                val[u] = 1;
        }
    }
}

int solve(char *s){
    int ls = strlen(s);
    dp[0][0] = 1;
    for (int i = 1; i < sz; i++) dp[0][i] = 0;

    for (int i = 0; i < ls; i++){
        for (int j = 0; j < sz; j++) dp[i + 1][j] = INF;

        for (int j = 0; j < sz; j++){
            if (val[j]) continue;
            for (int k = 0; k < 4; k++){
                int v = ch[j][k];
                dp[i + 1][v] = min(dp[i + 1][v], dp[i][j] + (idx(s[i]) != k));
                //最少修改几次？
                //母串的前i个前缀在trie树中遍历，达到某个安全节点j需要修改的最小值dp[i][j];
            }
        }
    }
    int ans = INF;
    for (int i = 0; i < sz; i++){
        if (!val[i] && dp[ls][i] < ans){
            ans = dp[ls][i];
        }
    }
    if (ans == INF) ans = -1;
    return ans;
}
int main(){
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int kase = 0;
    while (~scanf("%d", &n) && n){
        init();
        getNext();
        scanf("%s", t);
        printf("Case %d: %d\n", ++kase,solve(t));
    }

}