标签：
| Time Limit: 2000MS | Memory Limit: 65536K | |
| Total Submissions: 7869 | Accepted: 3816 |
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
Output
Sample Input
3 4 abcb a 1000 1100 b 350 700 c 200 800
Sample Output
900
Hint
#include<iostream> #include<cstdio> #include<algorithm> #include <string.h> #include <math.h> using namespace std; int n,m; char str[2000]; int value[26]; int dp[2000][2000]; ///代表从 i,j的最小花费 int main() { while(scanf("%d%d",&n,&m)!=EOF){ scanf("%s",str); while(n--){ char c[2]; int v1,v2; scanf("%s%d%d",c,&v1,&v2); value[c[0]-‘a‘] = min(v1,v2); ///删掉和添加都可以变成回文串，选小的 } int len = strlen(str); memset(dp,0,sizeof(dp)); ///起点i应当趋0，终点j应当趋len。 for(int i=len-1;i>=0;i--){ for(int j=i+1;j<len;j++){ if(str[i]!=str[j]) { ///更新区间[i ,j]选择[i+1,j]左边添加str[i]在[i,j-1]右边添加str[j]中小的那个 dp[i][j] = min(dp[i+1][j]+value[str[i]-‘a‘],dp[i][j-1]+value[str[j]-‘a‘]); }else{ ///相等的话直接添上去 dp[i][j]=dp[i+1][j-1]; } } } printf("%d\n",dp[0][len-1]); } return 0; }
标签：
原文地址：http://www.cnblogs.com/liyinggang/p/5370331.html
