题目链接:https://vjudge.net/problem/UVA-1625
紫书P276
题意:两个序列,要求合成一个序列。总花费为每个颜色在新序列中相距最远的下标差之和。求最小花费。
思路:dp【i】【j】表示已经从序列12中移走了i、j个字符的最小花费。c【i】【j】表示当前有多少颜色已经开始但是尚未结束。每次dp【i】【j】累加即可,不需要存储颜色开始结束位置。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
const int maxn = 5000 + 5;
const int INF = 10000000;
char p[maxn], q[maxn];
int sp[26], sq[26], ep[26], eq[26];
int d[maxn][maxn], c[maxn][maxn];
int main()
{
int T, n, m;
scanf("%d", &T);
while (T--)
{
scanf("%s%s", p + 1, q + 1);
n = strlen(p + 1);
m = strlen(q + 1);
//将字母转化成数字
for (int i = 1; i <= n; i++)
p[i] -= 'A';
for (int i = 1; i <= m; i++)
q[i] -= 'A';
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;
}
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= m; j++)
{
if (!i && !j)
continue;
int v1 = INF, v2 = INF;
if (i)
v1 = d[i-1][j] + c[i-1][j]; //从p中取颜色
if (j)
v2 = d[i][j - 1] + c[i][j - 1]; //从q中取颜色
d[i][j] = min(v1, v2);
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]--;
}
}
}
cout << d[n][m] << endl;
}
return 0;
}