B - Cheapest Palindrome
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
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.
我们先看样例 abcb
1.可以去掉一个a 或者在尾部加一个a 最小值为1000
2.变成bcbabcb 或者 去掉bcb变成a
假设我们的样例变成：
3 4 abcb a 1000 1100 b 700 350 c 200 800
其实我们花费没有变，但是字符串变了 变成了 cac
我们可以发现不管是加上还是减去都可以使其变成一个回文串，所以这个是一个干扰项。加上一个和减去一个其实是相同的操作，我们只需要在这其中选一个小的值记录下来就可以了。
状态转移：
dp[i][j]表示 第i到j字符之间为回文串的总花费
假设 str[i] == str[j] 第i和j处的字符相同,那么我们只需往中间移动 ,因为当前的花费为0 dp[i][j] = dp[i+1][j - 1];
不相等的话 我们考虑在i - 1和 j + 1 的位置插入或者删除(操作都一样,后文统称插入)一个字符
dp[i][j] = min(dp[i + 1][j] + w[str[i] - 'a'],dp[i][j - 1] + w[str[j] - 'a']); 在后面插入一个i字符+'i'字符的花费 在前面插入一个j字符+'j'字符的花费
到此状态转移就结束了.
我们的循环怎么写呢i的循序肯定是要逆序的 j要循序
因为我们用到了 i+1和j-1的内容
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <stdio.h>
#include <ctype.h>
#define LL long long
#define ULL unsigned long long
#define mod 1000000007
#define INF 0x7ffffff
#define mem(a,b) memset(a,b,sizeof(a))
#define MODD(a,b) (((a%b)+b)%b)
#define maxn 2005
using namespace std;
const double eps = 1e-2;
int n,m;
int w[30];
int dp[maxn][maxn];
int main()
{
char str[maxn];
while(~scanf("%d%d",&m,&n)){
scanf("%s",str + 1);
mem(dp,0);
mem(w,0);
for(int i = 0; i < m; i++){
char x[maxn];
int a,b;
scanf("%s%d%d",x,&a,&b);
w[x[0] - 'a'] = min(a,b);
}
//for(int i = 1; i <= n; i++) dp[i][i] = 1;
for(int j = 2; j <= n; j++){
for(int i = j - 1; i >= 0; i--){
if(str[i] == str[j]) dp[i][j] = dp[i + 1][j - 1];
else dp[i][j] = min(dp[i + 1][j] + w[str[i] - 'a'],dp[i][j - 1] + w[str[j] - 'a']);
}
}
printf("%d\n",dp[1][n]);
}
return 0;
}