基本思路:(书中页码276)
d[i][j]表示a序列已经拿了i个,b序列已经拿了j个放到最终序列中时,最终序列所产生的最小花费。
状态转移方程:d[i][j]=min{d[i-1][j]+c[i-1][j],d[i][j-1]+c[i][j-1]},c[i][j]表示已经在a序列和b序列分别拿了i个和j个后,在最终序列中再放入一个时所产生的花费,也就是当前最终序列中已经开始还没有结束的颜色数。
预处理:提前将两个序列中出现的颜色的起始位置和结束位置求出来,后面求c的时候就只需O(1)时间复杂度了。
可以采用滚动数组来减少内存开销。
具体代码:
// UVa1625 Color Length
// Rujia Liu
#include<cstdio>
#include<cstring>
#include<algorithm>
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[2][maxn], c[2][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
int t = 0;
memset(c, 0, sizeof(c));
memset(d, 0, sizeof(d));
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[t^1][j] + c[t^1][j]; // remove from p
if(j) v2 = d[t][j - 1] + c[t][j - 1]; // remove from q
//d[t][j] = min(v1, v2);
//The code below is the code on the book, but I don't think it is right.
/*if(i) {
c[t][j] = c[t^1][j];
if(sp[p[i]] == i && sq[p[i]] > j) c[t][j]++;
if(ep[p[i]] == i && eq[p[i]] <= j) c[t][j]--;
} else if(j) {
c[t][j] = c[t][j - 1];
if(sq[q[j]] == j && sp[q[j]] > i) c[t][j]++;
if(eq[q[j]] == j && ep[q[j]] <= i) c[t][j]--;
}*/
if(v1<v2)
{
d[t][j]=v1;
c[t][j] = c[t^1][j];
if(sp[p[i]] == i && sq[p[i]] > j) c[t][j]++;
if(ep[p[i]] == i && eq[p[i]] <= j) c[t][j]--;
}
else
{
d[t][j]=v2;
c[t][j] = c[t][j - 1];
if(sq[q[j]] == j && sp[q[j]] > i) c[t][j]++;
if(eq[q[j]] == j && ep[q[j]] <= i) c[t][j]--;
}
}
t ^= 1;
}
printf("%d\n", d[t^1][m]);
}
return 0;
}