poj 3280 区间dp
来源:互联网 发布:dcp打包软件 编辑:程序博客网 时间:2024/06/02 01:53
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
思路见于超链接
一开始使用记忆化写的 ,但一直过不了,于是搜题解 ,dp思想很简单,
#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <algorithm>#include <cmath>using namespace std;const int maxn=2000+10;int n,m;char buf[maxn];int w[27];int dp[maxn][maxn];int a,b;char s;int main() {// freopen("input.txt","r",stdin); while(scanf("%d%d",&n,&m)!=EOF) { scanf("%s",buf); getchar(); for(int i=0;i<n;i++) { scanf("%c%d%d\n",&s,&a,&b); w[s-'a']=min(a,b); } memset(dp,0,sizeof(dp)); for(int r=0;r<m;r++) {//i作为区间游标 for(int l=r-1;l>=0;l--) { dp[l][r]=min(dp[l+1][r]+w[buf[l]-'a'],dp[l][r-1]+w[buf[r]-'a']); if(buf[l]==buf[r]) dp[l][r]=min(dp[l][r],dp[l+1][r-1]); } } printf("%d\n",dp[0][m-1]); } return 0;}
- POJ 3280 区间DP
- poj 3280 区间dp
- poj 3280 区间dp
- POJ 3280 (区间DP)
- POJ 3280 区间dp
- poj 3280 区间dp
- POJ 3280-区间DP
- POJ 3280 简单区间 DP
- POJ 3280(区间dp)
- poj 3280(简单区间dp)
- poj 3280 区间dp水题
- poj 3280 Cheapest Palindrome(区间DP)
- POJ 3280 Cheapest Palindrome (区间dp)
- poj 3280 Cheapest Palindrome (区间DP)
- poj 3280 Cheapest Palindrome (区间dp)
- poj 3280 Cheapest Palindrome(区间dp)
- Cheapest Palindrome (poj 3280 区间DP)
- [区间dp] poj 3280 Cheapest Palindrome
- (二)最流行的网络请求框架Rxjava2+Retrofit之Token处理
- JDK1.8环境变量配置
- 深入理解PHP对象赋值(没意思or有意思)
- HDU 1010
- HDOJ 2883 kebab (网络流)
- poj 3280 区间dp
- 【Servlet】(1)Servlet简介、Servlet底层原理、Servlet实现方式、Servlet生命周期
- AOP
- php之PDO (PHP DATA OBJECT)
- Bluetooth MESH探究 --- (1)
- apache-comnons系列之commons-dbutils1.7 学习笔记
- eclipse 编辑窗口不见了(打开左边的java、xml文件,中间不会显示代码)
- Hessian序列化对象之BasicSerializer(五)
- Python 爬虫 工具 列表