Cheapest Palindrome(动态规划)

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.

题意：给出一个由m中字母组成的长度为n的串，给出m种字母添加和删除花费的代价，求让给出的串变成回文串的代价。
由于是回文串，所以删除一个字母与在它镜像位置增加一个字母的效果是一样的，所以，只需要存储增删两者的最小值即可

代码附上：

#include <iostream>
#define M 2005
using namespace std;
char str[M],x;
int dp[M][M],cost[27];
int n,m,i,j,c1,c2;
int main()
{
//dp[i][j]，代表从i到j的子串变成回文的最小花费。
// 状态转移方程：
//如果对称方位的两个字符相同，则最小花费不变
//			if   str[i]=str[j]     dp[i][j]=dp[i+1][j-1]  
//如果不相等，取改变左侧字符或右侧字符最小花费
// 			else    dp[i][j]=min(dp[i+1][j],dp[i][j-1]) 
    while(~scanf("%d %d",&n,&m))
    {
        scanf("%s",str);
        for(i=1;i<=n;i++)
        {
			getchar();
            scanf("%c %d %d",&x,&c1,&c2);
            cost[x-'a']=min(c1,c2);          
        }
        for(i=m-1;i>=0;i--)
            for(j=i+1;j<m;j++)
        {
            if(str[i]==str[j]) dp[i][j]=dp[i+1][j-1];
            else dp[i][j]=min(dp[i+1][j]+cost[str[i]-'a'],dp[i][j-1]+cost[str[j]-'a']);
        }
        cout<<dp[0][m-1]<<endl;
    }
    return 0;
}