紫书颜色的长度UVa1625

为了明晰起见，声明了c[i][j]数组以存储还有多少个“不完全”的颜色（即已经开始但未终止）。d[i][j]则为颜色长度总和。状态转移方程为d[i][j]=min{d[i-1]d[j]+c[i-1]c[j],d[i][j-1]+c[i][j-1]}。结果为d[n][m]
参考自刘汝佳老师代码：

#include<iostream>
#include<string>
#include<cassert>
#include<numeric>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<set>
#include<sstream>
#include<fstream>
#include<cstdio>
#include<queue>
#include<unordered_map>
#include<tuple>
#include<deque>
#include<functional>
#include<iterator>
#include<array>
#include<forward_list>
using namespace std;

const int maxn = 5000 + 5;
const int INF = 1000000000;

char p[maxn], q[maxn]; // starts from position 1
int sp[26], sq[26], ep[26], eq[26]; // sp[i] start positions of character i in p
int d[maxn][maxn], c[maxn][maxn]; // c[i][j]: how many "incomplete" colors in the mixed sequence

int main() {
    //freopen("input.txt", "r", stdin);
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%s%s", p + 1, q + 1);

        int n = strlen(p + 1);
        int m = strlen(q + 1);
        for (int i = 1; i <= n; i++) p[i] -= 'A';
        for (int i = 1; i <= m; i++) q[i] -= 'A';

        // calculate s and e
        for (int i = 0; i < 26; i++) { sp[i] = sq[i] = INF; ep[i] = eq[i] = 0; }
        for (int i = 1; i <= n; i++) {
            sp[p[i]] = min(sp[p[i]], i);
            ep[p[i]] = i;
        }
        for (int i = 1; i <= m; i++) {
            sq[q[i]] = min(sq[q[i]], i);
            eq[q[i]] = i;
        }

        // dp
        memset(c[0], 0, sizeof(c[0]));//如果把这么大的数组c整个清零容易超时，清理c[0]即可
        memset(d[0], 0, sizeof(d[0]));
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= m; j++) {
                if (!i && !j) continue;

                // calculate d
                int v1 = INF, v2 = INF;
                if (i) v1 = d[i - 1][j] + c[i - 1][j]; // remove from p
                if (j) v2 = d[i][j - 1] + c[i][j - 1]; // remove from q
                d[i][j] = min(v1, v2);

                // calculate c
                if (i) {
                    c[i][j] = c[i - 1][j];
                    if (sp[p[i]] == i && sq[p[i]] > j) c[i][j]++;
                    if (ep[p[i]] == i && eq[p[i]] <= j) c[i][j]--;
                }
                else if (j) {
                    c[i][j] = c[i][j - 1];
                    if (sq[q[j]] == j && sp[q[j]] > i) c[i][j]++;
                    if (eq[q[j]] == j && ep[q[j]] <= i) c[i][j]--;
                }
            }
        }
        printf("%d\n", d[n][m]);
    }
    return 0;
}