POJ3280Cheapest Palindrome(区间dp)
来源:互联网 发布:黑莓9930安装软件 编辑:程序博客网 时间:2024/06/07 02:47
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 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
Sample Input
3 4abcba 1000 1100b 350 700c 200 800
Sample Output
900
Hint
Source
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define N 2005int dp[N][N],n,m;int add[N],del[N];char a[N],ch[N];int main(){int i,j;while(~scanf("%d%d",&n,&m)){scanf("%s",a);int x,y;for(i=0;i<n;i++){scanf("%s%d%d",ch,&x,&y);add[ch[0]-'a']=x;del[ch[0]-'a']=y;}memset(dp,0,sizeof(dp));for(i=m-1;i>=0;i--) for(j=i+1;j<m;j++){ dp[i][j]=min(dp[i+1][j]+del[a[i]-'a'],dp[i+1][j]+add[a[i]-'a']); int temp=min(dp[i][j-1]+del[a[j]-'a'],dp[i][j-1]+add[a[j]-'a']); dp[i][j]=min(temp,dp[i][j]); if(a[i]==a[j])dp[i][j]=min(dp[i][j],dp[i+1][j-1]);}printf("%d\n",dp[0][m-1]);}return 0;}
- POJ3280Cheapest Palindrome(区间dp)
- 挑战练习题2.3动态规划 poj3280Cheapest Palindrome 区间dp
- poj3280Cheapest Palindrome
- Palindrome subsequence(区间dp)
- POJ3280:Cheapest Palindrome(区间DP)
- HDU4632:Palindrome subsequence(区间DP)
- POJ3280 Cheapest Palindrome 区间DP
- 区间dp poj3280 Cheapest Palindrome
- Cheapest Palindrome(区间DP)
- [区间DP]UVA 12960 Palindrome
- poj3280 Cheapest Palindrome(区间dp)
- Cheapest Palindrome(区间dp)
- hdu4632 Palindrome subsequence--区间dp
- [区间dp]poj3280 Cheapest Palindrome
- POJ3280-Cheapest Palindrome-区间dp
- POJ-1159 Palindrome (区间dp)
- HDU 4632 Palindrome subsequence(区间dp)
- bnu 33966 Almost Palindrome 区间dp
- malloc kmalloc vmalloc
- 2014华中科技大学考研复试机试题之进制转换
- Could not transfer artifact org.libvirt:libvirt:jar:0.4.9 from/to libvirt-org
- ios学习笔记
- C++拾遗--new delete 重载
- POJ3280Cheapest Palindrome(区间dp)
- Java—深入探讨equals
- 菜鸟练习PAT(一)
- 3D游戏引擎剖析
- Calling Extraterrestrial Intelligence Again
- Linux命令1——ls
- 关于The superclass "javax.servlet.http.HttpServlet" was not found on the Java Build Path错误
- [iOS] 经典应用-汤姆猫
- 全新定位方式:电量定位