poj 3280(区间DP)

时间:2023-01-16 18:55:19
Cheapest Palindrome
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

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:
回文串拥有很明显的子结构特征,即当字符串X是一个回文串时,在X两边各添加一个字符'a'后,aXa仍然是一个回文串,我们用d[i][j]来表示 A[i...j]这个子串变成回文串所需要添加的最少花费,那么对于A[i] == A[j]的情况,很明显有 d[i][j] = d[i+1][j-1] (这里需要明确一点,当i+1 > j-1时也是有意义的,它代表的是空串,空串也是一个回文串,所以这种情况下d[i+1][j-1] = 0)当A[i] != A[j]时,我们将它变成更小的子问题求解,我们有两种决策:
      1、在A[j]后面添加一个字符A[i],花费为d[i+1][j]+value[i];
      2、在A[i]前面添加一个字符A[j],花费为d[i][j-1] + value[j];
      根据两种决策列出状态转移方程为:
            d[i][j] = min{ d[i+1][j]+value[i], d[i][j-1]+value[j] } ;                (每次状态转移,区间长度增加1)
 
 
#include<iostream>
#include<cstdio>
#include<algorithm>
#include <string.h>
#include <math.h>
using namespace std; int n,m;
char str[];
int value[];
int dp[][]; ///代表从 i,j的最小花费
int main()
{ while(scanf("%d%d",&n,&m)!=EOF){
scanf("%s",str);
while(n--){
char c[];
int v1,v2;
scanf("%s%d%d",c,&v1,&v2);
value[c[]-'a'] = min(v1,v2); ///删掉和添加都可以变成回文串,选小的
}
int len = strlen(str);
memset(dp,,sizeof(dp));
///起点i应当趋0,终点j应当趋len。
for(int i=len-;i>=;i--){
for(int j=i+;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+][j]+value[str[i]-'a'],dp[i][j-]+value[str[j]-'a']);
}else{
///相等的话直接添上去
dp[i][j]=dp[i+][j-];
}
}
}
printf("%d\n",dp[][len-]);
}
return ;
}

另外可以枚举区间长度

#include<iostream>
#include<cstdio>
#include<algorithm>
#include <string.h>
#include <math.h>
using namespace std; int n,m;
char str[];
int value[];
int dp[][]; ///代表从 i,j的最小花费
int main()
{ while(scanf("%d%d",&n,&m)!=EOF){
scanf("%s",str);
while(n--){
char c[];
int v1,v2;
scanf("%s%d%d",c,&v1,&v2);
value[c[]-'a'] = min(v1,v2); ///删掉和添加都可以变成回文串,选小的
}
int len = strlen(str);
for(int l=;l<len;l++){ ///枚举区间长度
for(int i=;i+l<len;i++){
int j = i+l;
if(j>=len) break;
if(str[i]!=str[j]) {
///更新区间[i ,j]选择[i+1,j]左边添加str[i]在[i,j-1]右边添加str[j]中小的那个
dp[i][j] = min(dp[i+][j]+value[str[i]-'a'],dp[i][j-]+value[str[j]-'a']);
}else{
///相等的话直接添上去
dp[i][j]=dp[i+][j-];
}
}
}
printf("%d\n",dp[][len-]);
}
return ;
}

poj 3280(区间DP)的更多相关文章

  1. poj 2955 区间dp入门题

    第一道自己做出来的区间dp题,兴奋ing,虽然说这题并不难. 从后向前考虑: 状态转移方程:dp[i][j]=dp[i+1][j](i<=j<len); dp[i][j]=Max(dp[i ...

  2. POJ 2955 &lpar;区间DP&rpar;

    题目链接: http://poj.org/problem?id=2955 题目大意:括号匹配.对称的括号匹配数量+2.问最大匹配数. 解题思路: 看起来像个区间问题. DP边界:无.区间间隔为0时,默 ...

  3. POJ 1651 &lpar;区间DP&rpar;

    题目链接: http://poj.org/problem?id=1651 题目大意:加分取牌.如果一张牌左右有牌则可以取出,分数为左牌*中牌*右牌.这样最后肯定还剩2张牌.求一个取牌顺序,使得加分最少 ...

  4. POJ 1141 区间DP

    给一组小括号与中括号的序列,加入最少的字符,使该序列变为合法序列,输出该合法序列. dp[a][b]记录a-b区间内的最小值, mark[a][b]记录该区间的最小值怎样得到. #include &q ...

  5. POJ 3280 间隔DP

    字符串,每次插入或删除字符需要一定的价格,问:我怎样才能使这个字符串转换成字符串回文,花最少. 间隔DP 当DP到区间[i,j+1]时,我们能够在i-1的位置加入一个str[j+1]字符,或者将在j+ ...

  6. poj 1390 区间dp

    Blocks Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 5035   Accepted: 2065 Descriptio ...

  7. POJ 1651 区间DP Multiplication Puzzle

    此题可以转化为最优矩阵链乘的形式,d(i, j)表示区间[i, j]所能得到的最小权值. 枚举最后一个拿走的数a[k],状态转移方程为d(i, j) = min{ d(i, k) + d(k, j) ...

  8. poj 1141 区间dp&plus;递归打印路径

    Brackets Sequence Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 30383   Accepted: 871 ...

  9. POJ 3042 区间DP(费用提前计算相关的DP)

    题意: 思路: f[i][j][1]表示从i到j的区间全都吃完了 现在在j点 变质期最小是多少 f[i][j][0]表示从i到j的区间全都吃完了 现在在i点 变质期最小是多少 f[i][j][0]=m ...

随机推荐

  1. &lbrack;转&rsqb;Tomcat启动java&period;lang&period;OutOfMemoryError&colon; PermGen space错误解决

    原文地址:http://outofmemory.cn/java/OutOfMemoryError/outofmemoryerror-permgen-space-in-tomcat-with-eclip ...

  2. android 多媒体数据库(非原创)

    推荐文章:http://fzlihui.iteye.com/blog/1097952,http://www.cnblogs.com/pen-ink/archive/2011/06/02/2068410 ...

  3. 《玩转D语言系列》三、轻松*,把它当C语言先用起来

    前面说过,本系列文章的前提是您懂C语言,懂面向对象中的一些概念,如果没有任何变成基础,从零开始学习D语言将是一个漫长的过程,因为很多概念都要重新诠释,让一个没有基础的人经过漫长的学习过程,然后还找不到 ...

  4. Optimal Logging

    by Anthony Vallone How long does it take to find the root cause of a failure in your system? Five mi ...

  5. EBS基础—表的后缀

    1._ALL或无后缀:基表,所有对数据操作最终都是对基表的操作,表包含所有不同经营单位的信息,多组织环境. 2._B/_T:也是一种基表.一些数据和验证存储在此表中. 3._TL:语言的基表,TL表支 ...

  6. python PIL模块学习

    PIL PIL:Python Imaging Library.对于图像识别,大量的工作在于图像的处理,处理效果好,那么才能很好地识别,因此,良好的图像处理是识别的基础. PIL安装 安装推荐别人的吧, ...

  7. hexo&plus;github创建属于自己的博客

    配置环境 安装Node(必须) 作用:用来生成静态页面的 到Node.js官网下载相应平台的最新版本,一路安装即可. 安装Git(必须) 作用:把本地的hexo内容提交到github上去. 安装Xco ...

  8. js中事件冒泡,事件捕获详解

    一.事件流 事件是js与HTML交互的基础,事件流描述的是页面接受事件的顺序,而事件流又分为三个阶段:捕获阶段.目标阶段和冒泡阶段. 如果单纯的事件处理,事件捕获和事件冒泡二选一即可,导致两者并存的原 ...

  9. POST BOY &colon; Restful API 调试工具

    在使用asp.net webapi开发中,一般情况下会使用一些工具来模拟请求. 其中有一款chrome浏览器插件POST MAN比较不错. 但是由于国内google服务使用不稳定,所以我自己写了一个简 ...

  10. 从零开始学 Web 之 BOM(三)offset,scroll,变速动画函数

    大家好,这里是「 从零开始学 Web 系列教程 」,并在下列地址同步更新...... github:https://github.com/Daotin/Web 微信公众号:Web前端之巅 博客园:ht ...