poj 3280 Cheapest Palindrome(区间dp)

点击：http://poj.org/problem?id=3280

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.

题目大意：给出一个字符串，每添加或者删除一个字符都会有花费，求让字符串通过删除或者添加组成回文串的最小花费

分析：区间dp，dp[i][j]代表要使得区间i--j形成回文的最小花费，dp[i][j]=min(dp[i+1][j]+a[s[i]-'a'],dp[i][j-1]+a[s[j]-'a']),a[s[i]-'a']代表删除和添加该字符的最小花费。对于区间i-j形成回文的，在区间i+1--j时回文的基础上要么把i删除，要么在j的后面添加s[i],同理，在区间i--j-1是回文的基础上，要么把j删除，要么在i的前面添加s[j]。以上都有一个条件就是在i+1--j或者在i--j-1是回文的情况下，那么要先求dp[i+1][j]和dp[i][j-1]直到i+1==j时就容易求出他的回文了。这正好符合dp的子问题的特性，

需要特殊处理的是，当s[i]==s[j]的时候，dp[i][j]应该取dp[i][j]和dp[i+1][j-1]两者小的一个，因为s[i]==s[j]表明区间i--j的两个端点就是回文的了

#include <iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;

int dp[2500][2500];
int a[30];
char s[2500];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        scanf("%s",s);
        int b;
        char c[5];
        for(int i=0;i<n;i++)
        {
            scanf("%s",c);
            scanf("%d%d",&a[c[0]-'a'],&b);
            a[c[0]-'a']=min( a[c[0]-'a'],b);
        }
        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]+a[s[i]-'a'],dp[i][j-1]+a[s[j]-'a']);
                if(s[i]==s[j])dp[i][j]=min(dp[i][j],dp[i+1][j-1]);
            }
        }
        printf("%d\n",dp[0][m-1]);
    }
    return 0;
}