POJ 3280 Cheapest Palindrome（区间DP）

题意：给你一串字符串，你可以在字符串上对每一个元素进行增加或者删除的操作，分别给出每个元素增加和删除的代价，求最少代价使得这个字符串变成回文串

思路：我们令dp[i][j]为i到j成为回文串的最小代价，对于s[i]有两种选择增加或删除，dp[i][j]=min(dp[i+1][j]+add[s[i]],dp[i+1][j]+del[s[i]]); 对于s[j]同样两种操作，dp[i][j]=min(dp[i][j-1]+add[s[j]],dp[i][j-1]+del[s[j]]);  如果s[i]==s[j]，那么dp[i][j]=min(dp[i][j],dp[i+1][j-1]);

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 2005
#define LL long long
int cas=1,T;
int dp[maxn][maxn];
string s;
map<char,int>add,del;
int main()
{
	int n,m;
	while (scanf("%d%d",&n,&m)!=EOF)
	{
		cin >> s;
        for (int i = 0;i<n;i++)
		{
			char temp;
			scanf(" %c",&temp);
			int ad,de;
			scanf("%d%d",&ad,&de);
//			printf("%c %d %d\n",temp,ad,de);
			add[temp]=ad;
			del[temp]=de;
		}
        memset(dp,0,sizeof(dp));
		for (int i = m-1;i>=0;i--)
		{
            for (int j = i+1;j<m;j++)
			{
				dp[i][j]=min(dp[i+1][j]+add[s[i]],dp[i+1][j]+del[s[i]]);
				int temp =min(dp[i][j-1]+add[s[j]],dp[i][j-1]+del[s[j]]);
				dp[i][j]=min(dp[i][j],temp);
				if (s[i]==s[j])
					dp[i][j]=min(dp[i][j],dp[i+1][j-1]);
			}
		}
		printf("%d\n",dp[0][m-1]);
	}
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

Description

Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the cows pass by a scanner. Each ID tag's contents are currently a single string with length M (1 ≤ M ≤ 2,000) characters drawn from an alphabet of N (1 ≤ N ≤ 26) different symbols (namely, the lower-case roman alphabet).

Cows, being the mischievous creatures they are, sometimes try to spoof the system by walking backwards. While a cow whose ID is "abcba" would read the same no matter which direction the she walks, a cow with the ID "abcb" can potentially register as two different IDs ("abcb" and "bcba").

FJ would like to change the cows's ID tags so they read the same no matter which direction the cow walks by. For example, "abcb" can be changed by adding "a" at the end to form "abcba" so that the ID is palindromic (reads the same forwards and backwards). Some other ways to change the ID to be palindromic are include adding the three letters "bcb" to the begining to yield the ID "bcbabcb" or removing the letter "a" to yield the ID "bcb". One can add or remove characters at any location in the string yielding a string longer or shorter than the original string.

Unfortunately as the ID tags are electronic, each character insertion or deletion has a cost (0 ≤ cost ≤ 10,000) which varies depending on exactly which character value to be added or deleted. Given the content of a cow's ID tag and the cost of inserting or deleting each of the alphabet's characters, find the minimum cost to change the ID tag so it satisfies FJ's requirements. An empty ID tag is considered to satisfy the requirements of reading the same forward and backward. Only letters with associated costs can be added to a string.

Input

Line 1: Two space-separated integers:  N and  M
Line 2: This line contains exactly  M characters which constitute the initial ID string 
Lines 3..  N+2: Each line contains three space-separated entities: a character of the input alphabet and two integers which are respectively the cost of adding and deleting that character.

Output

Line 1: A single line with a single integer that is the minimum cost to change the given name tag.

Sample Input

3 4
abcb
a 1000 1100
b 350 700
c 200 800

Sample Output

900

Hint

If we insert an "a" on the end to get "abcba", the cost would be 1000. If we delete the "a" on the beginning to get "bcb", the cost would be 1100. If we insert "bcb" at the begining of the string, the cost would be 350 + 200 + 350 = 900, which is the minimum.