`
Simone_chou
  • 浏览: 182780 次
  • 性别: Icon_minigender_2
  • 来自: 广州
社区版块
存档分类
最新评论

Cheapest Palindrome(区间DP)

    博客分类:
  • POJ
 
阅读更多
Cheapest Palindrome
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 5458   Accepted: 2651

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.

Source

 

      题意:

      给出 N(1 ~ 26) 和 M (1 ~ 2000),后给出 M 长度的字符串,问如何增删其中的字母使其变成回文串,后给出 N 种字母 增加 和 删除分别的价钱,输出所需钱数最少使其变成回文串。

 

      思路:

      区间DP。设 dp [ i ] [ j ] 代表 i 到 j 使变成回文串的最少费用。所以:

      如果 s [ i ] == s [ j ],则说明不用进行操作,dp [ i ] [ j ] = dp [ i + 1 ] [ j - 1 ];

      否则,要不 对 s [ i ] 进行增删处理,或者对 s [ j ] 进行增删处理,而对于一个字母的增删操作只要取一个最小值就好了;

      所以 dp [ i ] [ j ] = min ( dp [ i + 1 ] [ j ] + cost [ s[ i ] ] , dp [ i ] [ j - 1 ] + cost [ s[ j ] ] )(dp [ i ] [ j ] 代表的是 i 到 j 已经变成回文串时候的最小费用,所以这个状态表示的已经是回文串了)。

 

      AC:

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

char s[2005];
int cost[30];
int dp[2005][2005];

int main() {
        int n, m;
        scanf("%d%d", &n, &m);
        scanf("%s", s);

        while (n--) {
                char c;
                int a, b;
                scanf(" %c%d%d", &c, &a, &b);
                cost[c - 'a'] = min(a, b);
        }

        memset(dp, 0, sizeof(dp));
        for (int j = 1; j < m; ++j) {
                for (int i = j - 1; i >= 0; --i) {
                        if (s[j] == s[i])  dp[i][j] = dp[i + 1][j - 1];
                        else {
                                int c1 = dp[i + 1][j] + cost[ s[i] - 'a' ];
                                int c2 = dp[i][j - 1] + cost[ s[j] - 'a' ];
                                dp[i][j] = min(c1, c2);
                        }
                }
        }

        printf("%d\n", dp[0][m - 1]);
        return 0;
}

 

 

分享到:
评论

相关推荐

    代码 动态规划 特殊数据结构搜索、枚举

    1043 Cheapest Palindrome 1045 Cake Cutting 1049 Brackets 特殊数据结构 1004 Prince Ray’s Puzzle 树状数组 1010 选队长 二叉树 1022 Longest Common Sequence 也可用二叉搜索树(nlog时间)解决,见llj的书 ...

    Cheapest Flights Within K Stops

    Example 1: Input: n = 3, edges = [[0,1,100],[1,2,100],[0,2,500]] src = 0, dst = 2, k = 1 Output: 200 Explanation: The graph looks like this: 思路:就是要弄明白graph怎么建立,pq里面存什么,怎么进行...

    Cheapest-path decider-开源

    这是一种工具(MATLAB代码),用于在包含彩色正方形的迷宫中找出最小的路径,其中每种颜色都有其自己指定的重量/成本。 默认情况下,已对其编程以计算8x8方形迷宫中的路径。

    Find-the-cheapest-Hotel

    寻找最便宜的酒店 迈阿密的一家连锁酒店希望通过互联网提供客房预订服务。 他们在迈阿密拥有3家酒店:莱克伍德,布里奇伍德和里奇伍德。 每个酒店都有不同的平日和周末(周六和周日)价格。 作为忠诚度计划的一部分...

    Cheapest Rental Car Price Finder-crx插件

    语言:English (United States) 寻找您附近的最佳优惠! 这款镀Chrome扩展件在这里为您提供您所在位置附近最便宜的汽车租赁价格。 您可以使用信用卡或借记卡在应用程序内进行预订。 您可以随时使用它来制定旅行计划。...

    Cheapest country to buy cameras-crx插件

    语言:English,日本語 在亚马逊产品页面上显示亚马逊的最低价格。 在亚马逊产品页面上显示亚马逊的最低价格。 该扩展程序当前支持相机机身和镜头套件。 亚马逊以下扩展支持:澳大利亚,巴西,加拿大,中国,法国,...

    最便宜的租车价格搜索器「Cheapest Rental Car Price Finder」-crx插件

    搜索您附近的最佳交易! 这铬扩展是在这里给你提供最便宜的租车价格在你的地方附近。您可以使用信用卡或借记卡在申请表内预订。 您可以随时使用它,以使您的旅行计划。应用程序将收集所有汽车租赁公司的所有价格,并...

    Hashtagpirate.com -搜索Instagram标签。「Hashtagpirate.com - Search Instagram hashtags」「Hashtagpirate.com - Cheapest Instagram Bot」-crx插件

    在Instagram上搜索多个标签,搜索Instagram视频。 通过我们的Instagram关注者应用,快速发展您的Instagram并每月获得多达1000个关注者。 使用我们的自动化服务,例如自动赞,自动关注,Instagram自动消息,自动评论...

    Cheapest-Flight-Finder:通过从外部文件构建航班信息图来实现 Dijkstra 的最短路径算法。 然后,它会提示用户输入起始机场,并根据您提供的数据为飞往所有目的地的最便宜航班创建最佳价格报告

    最便宜的航班查找器 通过从外部文件构建航班信息图来实现 Dijkstra 的最短路径算法。 然后,它会提示用户输入起始机场,并根据您提供的数据为飞往所有目的地的最便宜航班创建最佳价格报告。

    Christian Louboutin Shoes, Free shipping on discount and cheap shoes online sale

    New style discount Christian Louboutin shoes on sale, quality guaranteed and cheapest Christian Louboutin boots, more kinds of Christian Louboutin pumps onlouboutinshoes.com

    Raspberry Pi Blueprints(PACKT,2015)

    The Raspberry Pi is one of the cheapest and most popular single-board computers, as such it has become a platform for users to create their own interesting hardware and software projects. It's capable...

    dohop-hackathon

    Dohop 黑客马拉松 Dohop 开放了对机票价格 ... 'cheapest_date': '2015-06-05', 'cheapest_price': 9573, 'expensive_date': '2015-08-20', 'expensive_price': 59149, 'my_price': 16061, 'price_count': 106} G

    To Fill or Not to Fill

    With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to ... You are asked to carefully design the cheapest route to go.

    Google Maps Hacks

    The cheapest gas stations on a day-to-day basis? The location of convicted sex offenders in an area to which you may be considering moving? The applications, serendipitous and serious, seem to be ...

    laravel-sort-request:through通过您的Laravel请求对口才模型进行排序

    # Get the cheapest items https://example.test/items ? sort=price(asc) # Get the items sorted by name and size https://example.test/items ? sort=name(asc),size(desc) # Get the most popular TV Shows ...

    currency_checker

    货币检查器 货币检查器提供了一个宁静的API,可返回最便宜的货币量 科技类 Django REST框架 码头工人 昂首阔步 请求-未来 雷迪斯 安装 您可以通过轻松运行该应用程序 docker-compose up --build -d ... "cheapest_a

    Raspberry.Pi.Blueprints.1784392901

    The Raspberry Pi is one of the cheapest and most popular single-board computers, as such it has become a platform for users to create their own interesting hardware and software projects. It's capable...

    Raspberry Pi Zero Cookbook

    Get into grips with integrating various hardware, programming, and networking concepts with the so-called “cheapest computer” Explore the functionalities of this $5 chip through practical recipes ...

    MSSQL ADO Direct Access Components Crack

    So, if developers amount of your team is more than 2, the best (cheapest) way for you is to purchase Site license. See License Agreement for details, it is included into trial package. After purchase...

    在Amazon上按图搜索-crx插件

    On the search results page, you can see the price and choose the cheapest option! Try searching for branded items. We know that Amazon is full of copies of different brands and sellers. Now you can ...

Global site tag (gtag.js) - Google Analytics