POJ 3280 Cheapest Palindrome （区间DP）

题意：给出一个字符串，每个字符增加或删除有一个费用，求出使得这个字符串变成回文串的最小花费。

思路：区间DP。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

const int MAXN = 2100;
//const int INF = 0x3f3f3f3f;
int n, alp, tot;
int dp[MAXN][MAXN], cost[30][2];
char str[MAXN];
map<char, int> Hash;
int idx(char x) {
	if(Hash[x]) return Hash[x];
	else return Hash[x] = ++tot;
}
void DP() {
	for(int i = 1; i <= n; i++) dp[i][i] = 0;
	for(int len = 2; len <= n; len++) {
		for(int i = 1; i+len-1 <= n; i++) {
			dp[i][i+len-1] = dp[i][i+len-2] + min(cost[idx(str[i+len-1])][0], cost[idx(str[i+len-1])][1]);
			dp[i][i+len-1] = min(dp[i][i+len-1], dp[i+1][i+len-1]+min(cost[idx(str[i])][0], cost[idx(str[i])][1]));
			if(str[i]==str[i+len-1]) dp[i][i+len-1] = min(dp[i][i+len-1], dp[i+1][i+len-2]);
		}
	}
}
int main() {
    //freopen("input.txt", "r", stdin);
	while(cin >> alp >> n >> str+1) {
		Hash.clear();
		tot = 0;
		for(int i = 1; i <= alp; i++) {
			char tmp[3]; scanf("%s", tmp);
			int u, v; scanf("%d%d", &u, &v);
			cost[idx(tmp[0])][0] = u;
			cost[idx(tmp[0])][1] = v;
		}
		DP();
		cout << dp[1][n] << endl;
	}
    return 0;
}