POJ 3280
来源:互联网 发布:cf36 1网络异常 编辑:程序博客网 时间:2024/06/03 12:44
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
题意:
输出把整个串变为回文的最小花费,你可以任意删除字母或增加字母,给你了他们的花费。
POINT:
删去一个字母等于在另一边加上这个字母,所以每次操作取一个min(+,-)就好。
#include <iostream>#include <stdio.h>#include <string.h>#include <vector>#include <queue>using namespace std;#define LL long longconst int maxn = 2222;const int inf = 0x3f3f3f3f;LL dp[maxn][maxn];LL cost[maxn];int main(){ char s[maxn]; int n,m; scanf("%d %d",&n,&m); scanf("%s",s+1); for(int i=1;i<=n;i++){ char c; LL a,b; cin>>c>>a>>b; cost[c]=min(a,b); } memset(dp,0,sizeof dp); for(int len=2;len<=m;len++){ for(int i=1;i<=m-len+1;i++){ int j=i+len-1; if(s[i]==s[j]) dp[i][j]=dp[i+1][j-1]; else dp[i][j]=min(dp[i+1][j]+cost[s[i]],dp[i][j-1]+cost[s[j]]); } } printf("%lld\n",dp[1][m]); }
- POJ 3280
- poj 3280
- poj 3280
- poj 3280
- poj-3280
- poj 3280
- poj 3280
- poj-3280
- POJ 3280
- Poj 3280 Cheapest Palindrome
- POJ 3280 dp
- POJ 3280 Cheapest Palindrome
- Poj 3280(dp)
- poj 3280 Cheapest Palindrome
- DP 之 poj 3280
- POJ 3280 Cheapest Palindrome
- POJ 3280 区间DP
- poj 3280 简单dp
- PHP消息队列
- python简洁代码实现快速排序
- Tensorflow 使用slim框架下的分类模型进行分类
- 第九章 Nginx服务器的邮件服务【笔记】
- BigDecimal
- POJ 3280
- opencv——利用轮廓信息画斜矩形、外接圆、拟合直线等
- U盘出现无法访问,文件或目录损坏且无法读取的情况的解决办法。
- 组合聚合区别
- POJ 1811 Prime Test(大素数判断和素因子分解)
- 树莓派3B+ 前世今生
- 【乱搞】BZOJ5074 [Lydsy十月月赛]小B的数字
- Eclipse下SVN插件安装、使用及SVN服务器的搭建
- FFMPEG Qt视频播放器之美化界面