hdu 2457(ac自动机+dp)

题意：有n个模式串，一个目标串，问如果要修改目标串使目标串内没有模式串，问最少修改多少个字符。
题解：n最大50，字符只有4种，可以dp，f[i][j]表示前i个字符，当前节点是j最少修改多少个字符，那么状态转移的前提是跳转的节点不是trie树中非模式串结尾节点，那么如果当前跳转点不是目标串对应位置的点，f[i][next[j][k]] = min(f[i][next[j][k]], f[i - 1][j] + 1)，否则f[i][next[j][k]] = min(f[i][next[j][k]], f[i - 1][j])。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
const int N = 1005;
const int INF = 0x3f3f3f3f;
int Next[N][4], fail[N], val[N], sz, n, res;
char str[N];
int f[N][N];
map<char, int> mp;

void init() {
    memset(Next[0], 0, sizeof(Next[0]));
    val[0] = 0;
    sz = 1;
}

void insert(char *s) {
    int u = 0, len = strlen(s);
    for (int i = 0; i < len; i++) {
        int k = mp[s[i]];
        if (!Next[u][k]) {
            memset(Next[sz], 0, sizeof(Next[sz]));
            val[sz] = 0;
            Next[u][k] = sz++;
        }
        u = Next[u][k];
    }
    val[u] = 1;
}

void getFail() {
    queue<int> Q;
    fail[0] = 0;
    for (int i = 0; i < 4; i++)
        if (Next[0][i]) {
            fail[Next[0][i]] = 0;
            Q.push(Next[0][i]);
        }
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();
        if (val[fail[u]])
            val[u] = 1;
        for (int i = 0; i < 4; i++) {
            if (!Next[u][i])
                Next[u][i] = Next[fail[u]][i];
            else {
                fail[Next[u][i]] = Next[fail[u]][i];
                Q.push(Next[u][i]);
            }
        }
    }
}

void dp() {
    res = INF;
    int len = strlen(str);
    for (int i = 0; i <= len; i++)
        for (int j = 0; j < sz; j++)
            f[i][j] = INF;
    f[0][0] = 0;
    for (int i = 1; i <= len; i++)
        for (int j = 0; j < sz; j++)
            for (int k = 0; k < 4; k++)
                if (!val[Next[j][k]]) {
                    if (mp[str[i - 1]] == k)
                        f[i][Next[j][k]] = min(f[i][Next[j][k]], f[i - 1][j]);
                    else
                        f[i][Next[j][k]] = min(f[i][Next[j][k]], f[i - 1][j] + 1);
                }
    for (int i = 0; i < sz; i++)
        res = min(res, f[len][i]);
    if (res == INF)
        res = -1;
}

int main() {
    mp['A'] = 0;
    mp['C'] = 1;
    mp['G'] = 2;
    mp['T'] = 3;
    int cas = 1;
    while (scanf("%d", &n) == 1 && n) {
        init();
        for (int i = 0; i < n; i++) {
            scanf("%s", str);
            insert(str);
        }
        getFail();
        scanf("%s", str);
        dp();
        printf("Case %d: %d\n", cas++, res);
    }
    return 0;
}