POJ 3280 Cheapest Palindrome区间dp

Cheapest Palindrome

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  POJ 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.

题意：给你一个串，花最少的代价让它变成回文串，每一个字符的插入删除代价已经列出来了

思路：

1，首先对于一个字符，如果它没有匹配，有两种选择，插入&&删除都是可行的，那么一定是从这两个代价中选择最小的那一个。

2，这题是个区间dp，枚举区间后有两个状态转移：

a： dp [ i ][ j ]= min ( dp [ i +1 ][ j ]+ cost [ str [ i ]- 'a' ], dp [ i ][ j -1 ]+ cost [ str [ j ]- 'a' ]);

若不匹配，对于区间两侧的字符要么删除，要么插入，选一个代价最小的。

b： if ( str [ i ]== str [ j ]) dp [ i ][ j ]= min ( dp [ i ][ j ], dp [ i +1 ][ j -1 ]);

如果匹配了，那么直接等于i+1...j-1区间的值即可

#include
#include
#include
#include
using namespace std;
const int maxn = 2005 ;
char str[maxn] ;
int dp[maxn][maxn] ;
int cost[30] ;
int n,m;
int main() {
    while(~scanf("%d%d",&n,&m)) {
        scanf("%s",str) ;
        for(int i=1; i<=n; i++) {
            char a[3];
            int b,c;
            scanf("%s%d%d",a,&b,&c) ;
            cost[a[0]-'a']=min(b,c);
        }
        for (int i = m - 1; i >= 0; --i) {
            for (int j = i + 1; j < m; ++j) {
                dp[i][j]=min(dp[i+1][j]+cost[str[i]-'a'],dp[i][j-1]+cost[str[j]-'a']);
                if (str[i]==str[j]) {
                    dp[i][j]=min(dp[i][j],dp[i+1][j-1]);
                }
            }
        }
        printf("%d\n",dp[0][m-1]);
    }
    return 0;
}