UVALive4394-String painter（dp）

题目链接

http://acm.hust.edu.cn/vjudge/problem/19916

思路

直接将A串刷成B串比较困难，考虑从另一个状态开始转移，比如先将空串刷成B串。
空串刷成B串就是比较简单的区间dp了
定义状态：d[i][j]将空串刷成区间[i, j]的状态所需要的最少操作次数
转移方程：

首先当B[i] == B[j]时，d[i][j] = d[i][j - 1]（显然将空串刷成abbsd和刷成abbsda所需要的操作次数相同）

否则d[i][j] = min(d[i][j], d[i, k] + d[k + 1][j]) (i ≤ k < j)

然后再考虑递推出A串转移成B串所需要的最少操作次数
定义状态：f[i]将前i个A的字符刷成B的前i个字符所需要的最少操作次数
转移方程：

当A[i] == B[i]时，相当于该位置不用转移，f[i] = f[i - 1];

否则，f[i] = min(f[i], f[j] + d[j + 1][i]);

细节

f[i] = min(f[i], f[j] + d[j + 1][i])时，注意j的下标实际上可以从i - 1开始取，即直接从空串开始转移

代码

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)
#define pr(x) cout << #x << " = " << x << endl
#define lc o << 1
#define rc o << 1 | 1
#define pl() cout << endl
#define CLR(a, x) memset(a, x, sizeof(a))
#define FILL(a, n, x) for (int i = 0; i < n; i++) a[i] = x

const int maxn = 105;
const int INF = 0x3e3e3e3e;
char A[maxn], B[maxn];
int a[maxn][maxn], n;

int d[maxn][maxn];
int f[maxn];
int dp(int i, int j) {
    if (d[i][j] >= 0) return d[i][j];
    if (i == j) return d[i][j] = 1;
    d[i][j] = n;
    for (int k = i; k < j; k++) d[i][j] = min(d[i][j], dp(i, k) + dp(k + 1, j));
    if (B[i] == B[j]) d[i][j] = min(d[i][j], dp(i, j - 1));
    return d[i][j];
}

int solve() {
    f[0] = (A[0] == B[0] ? 0 : 1);
    for (int i = 1; i < n; i++) {
        f[i] = d[0][i];
        for (int j = 0; j < i; j++) {
            f[i] = min(f[i], f[j] + d[j + 1][i]);
        }
        if (A[i] == B[i]) f[i] = f[i - 1];
    }
    return f[n - 1];
}

int main() {
    while (~scanf("%s%s", A, B)) {
        n = strlen(A);
        CLR(d, -1);
        dp(0, n - 1);
        memset(f, 0, sizeof(f));
        int res = solve();
        printf("%d\n", res);
        memset(A, '\0', sizeof(A));
        memset(B, '\0', sizeof(B));
    }
    return 0;
}