动态规划
文章平均质量分 71
喵头鹰
一只小弱鸡~~
展开
-
动态规划之最大子段和问题
问题描述:最大子段和问题是将一个n个整数的序列a[1],a[2]….a[n]中字段a[first]….a[last]之和,(1<=first<=last<=n)求这些子段和中最大的。 例如(a[1],a[2],a[3],a[4],a[5],a[6])=(-2,11,-4,13,-5,-2)时,最大子段和为20,子段为a[2],a[3],a[4]。求解方法:如果不会算法,那就用时间复杂度为O(n^3原创 2016-05-31 11:34:38 · 23376 阅读 · 3 评论 -
HDU 2639 Bone Collector II 01背包第k优解
题目描述:Description The title of this problem is familiar,isn’t it?yeah,if you had took part in the “Rookie Cup” competition,you must have seem this title.If you haven’t seen it before,it doesn’t matter,原创 2016-05-18 19:40:33 · 382 阅读 · 0 评论 -
ZOJ 3822 Domination 概率DP入门
题目描述:Description Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What’s more, he bought a large decorative chessboard with N rows原创 2016-04-22 19:35:00 · 320 阅读 · 0 评论 -
区间DP入门之 石子归并问题
题目描述:有N堆石子排成一排,每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆,每次合并花费的代价为这两堆石子的和,经过N-1次合并后成为一堆。求出总的代价最小值。 输入 有多组测试数据,输入到文件结束。 每组测试数据第一行有一个整数n,表示有n堆石子。 接下来的一行有n(0< n <200)个数,分别表示这n堆石子的数目,用空格隔开 输出 输出原创 2016-04-21 21:40:39 · 2421 阅读 · 0 评论 -
HDU 4745 Two Rabbits 区间DP
题目描述:Description Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to play a game with some stones. There were n stones on the ground and they were原创 2016-05-06 09:07:55 · 734 阅读 · 0 评论 -
HDU 5396 Expression 区间DP
题目描述:Problem Description Teacher Mai has n numbers a1,a2,⋯,anand n−1 operators(“+”, “-” or “*”)op1,op2,⋯,opn−1, which are arranged in the form a1 op1 a2 op2 a3 ⋯ an.He wants to erase numbers one by on原创 2016-05-05 20:18:17 · 517 阅读 · 0 评论 -
POJ 1837 Balance 类似01背包
题目描述:DescriptionGigel has a strange “balance” and he wants to poise it. Actually, the device is different from any other ordinary balance. It orders two arms of negligible weight and each arm’s lengt原创 2016-05-16 19:58:36 · 294 阅读 · 0 评论 -
POJ 1276 Cash Machine 多重背包
题目描述:DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominat原创 2016-05-16 17:41:05 · 245 阅读 · 0 评论 -
HDU 1712 ACboy needs your help 分组背包
题目描述:Description ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrang原创 2016-05-18 20:43:33 · 246 阅读 · 0 评论 -
HDU 5188 zhx and contest 01背包的变形
题目描述:Problem Description As one of the most powerful brushes in the world, zhx usually takes part in all kinds of contests. One day, zhx takes part in an contest. He found the contest very easy for h原创 2016-05-19 11:52:37 · 377 阅读 · 0 评论 -
CodeForces 149D Coloring Brackets
题目描述:直接扔连接了-.- http://codeforces.com/problemset/problem/149/D题目分析:括号的填色。 有两种颜色和不填色。 满足: 1.每对括号都要填色。 2.每对括号只有一个(左括号或右括号)能填色,另一个不填色。 3.连续的两个括号不能相同颜色。(当然可以都不填色)区间DP题。 dp[l][r][c1][c2]表示在区间(l,r)中,l填原创 2016-05-08 20:24:50 · 412 阅读 · 0 评论 -
HDU 5092 Seam Carving DP
题目描述:Problem Description Fish likes to take photo with his friends. Several days ago, he found that some pictures of him were damaged. The trouble is that there are some seams across the pictures. So原创 2016-10-13 20:02:20 · 458 阅读 · 0 评论 -
数位DP!!!(hdu3555 hdu2089 hdu5898 2016弱校10.5 I)
博客描述:各种数位DP,均是用模板做的。先把模板一放!// pos = 当前处理的位置(一般从高位到低位)// pre = 上一个位的数字(更高的那一位)// status = 要达到的状态,如果为1则可以认为找到了答案,到时候用来返回,// 给计数器+1。// limit = 是否受限,也即当前处理这位能否随便取值。如567,当前原创 2016-10-13 11:41:48 · 500 阅读 · 0 评论 -
51NOD 1006 最长公共子序列 动态规划
题目描述:给出两个字符串A B,求A与B的最长公共子序列(子序列不要求是连续的)。 比如两个串为:abcicba abdkscabab是两个串的子序列,abc也是,abca也是,其中abca是这两个字符串最长的子序列。Input 第1行:字符串A 第2行:字符串B (A,B的长度 <= 1000)Output 输出最长的子序列,如果有多个,随意输出1个。Input示例abcicbaab原创 2016-09-25 21:30:31 · 1249 阅读 · 0 评论 -
URAL 2018 The Debut Album DP中滚动数组用法
题目描述:Description Pop-group “Pink elephant” entered on recording their debut album. In fact they have only two songs: “My love” and “I miss you”, but each of them has a large number of remixes. The pr原创 2016-08-13 19:34:39 · 557 阅读 · 0 评论 -
HDU 5791 Two DP
题目描述:Problem Description Alice gets two sequences A and B. A easy problem comes. How many pair of sequence A’ and sequence B’ are same. For example, {1,2} and {1,2} are same. {1,2,4} and {1,4,2} are n原创 2016-08-04 10:20:03 · 502 阅读 · 1 评论 -
ACdream 1216 Beautiful People 二路最长上升子序列
题目描述:Description The most prestigious sports club in one city has exactly N members. Each of its members is strong and beautiful. More precisely, i-th member of this club (members being numbered原创 2016-06-14 19:41:25 · 370 阅读 · 0 评论 -
CodeForces #589 B Layer Cake 类似01背包的模拟题
题目描述:Description Dasha decided to bake a big and tasty layer cake. In order to do that she went shopping and bought n rectangular cake layers. The length and the width of the i-th cake layer were ai a原创 2016-05-22 18:47:13 · 450 阅读 · 0 评论 -
HDU 5445 Food Problem 两次多重背包
题目描述:Problem Description Few days before a game of orienteering, Bell came to a mathematician to solve a big problem. Bell is preparing the dessert for the game. There are several different types of d原创 2016-05-20 16:59:40 · 372 阅读 · 0 评论 -
HDU 3076 ssworld VS DDD 概率DP入门
题目描述:Problem Description One day, sssworld and DDD play games together, but there are some special rules in this games. They both have their own HP. Each round they dice respectively and get the poin原创 2016-04-21 12:27:14 · 388 阅读 · 0 评论 -
HDU 5045 Contest 状态压缩DP
题目描述:Description In the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are given 5 hours to solve between 8 and 12 programming problems. On Mars,原创 2016-04-20 19:37:37 · 322 阅读 · 0 评论 -
编辑距离 动态规划
题目描述:编辑距离,又称Levenshtein距离(也叫做Edit Distance),是指两个字串之间,由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符,插入一个字符,删除一个字符。 例如将kitten一字转成sitting: sitten (k->s) sittin (e->i) sitting (->g) 所以kitten和sitting的编辑距离原创 2016-03-13 14:47:48 · 340 阅读 · 0 评论 -
POJ 3311 Hie with the Pie 状压DP
题目描述:DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries原创 2016-03-23 20:07:15 · 276 阅读 · 0 评论 -
Mondriaan's Dream POJ2411
题目描述:Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his ‘toilet series’ (where he had to use his toilet paper to draw on, for all原创 2016-03-21 19:27:50 · 319 阅读 · 0 评论 -
HDU 1561 The more, The Better 树形DP
题目描述:Description ACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因,有些城堡不能直接攻克,要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗? Input 每个测试实例首先包括2个整数,N,M.(1 <= M <= N原创 2016-04-04 20:56:52 · 256 阅读 · 0 评论 -
POJ1185 炮兵阵地 状压dp
题目描述:司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用”H” 表示),也可能是平原(用”P”表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示: 如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色的网格表示它能够攻击到的区域:沿原创 2016-03-22 13:30:03 · 401 阅读 · 0 评论 -
Wireless Password HDU2825
题目描述:Liyuan lives in a old apartment. One day, he suddenly found that there was a wireless network in the building. Liyuan did not know the password of the network, but he got some important informatio原创 2016-03-17 16:34:49 · 407 阅读 · 0 评论 -
HDU 4123 Bob’s Race(树形DP,rmq)
Bob’s RaceTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1994 Accepted Submission(s): 619Problem Description Bob wants to hold a race to e转载 2016-04-01 21:17:01 · 302 阅读 · 0 评论 -
HDU 4315 Save the dwarfs 动态规划
题目描述:Several dwarfs are trapped in a deep well. They are not tall enough to climb out of the well, so they want to make a human-pyramid, that is, one dwarf stands on another’s shoulder, until the dwarf原创 2016-03-19 16:47:55 · 352 阅读 · 0 评论 -
HDU 3001 Travelling 三进制状压DP
题目描述:DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not mind w原创 2016-03-24 20:53:30 · 301 阅读 · 0 评论 -
01背包 动态规划
题目描述:有一个国家,所有的国民都非常老实憨厚,某天他们在自己的国家发现了n座金矿,并且这n座金矿在地图上排成一条直线,国王知道这个消息后非常高兴,他希望能够把这些金子都挖出来造福国民,首先他把这些金矿按照在地图上的位置从西至东进行编号,依次为0,1,2…n-1,然后他命令他的手下去对每一座金矿进行勘测,以便知道挖取每一座金矿需要多少人力以及每座金矿能够挖出多少金子,然后动员国民都来挖金子。最后,国原创 2016-03-12 20:18:22 · 360 阅读 · 0 评论 -
HDU 3586 Information Disturbing 树形DP+二分
题目描述:Description In the battlefield , an effective way to defeat enemies is to break their communication system. The information department told you that there are n enemy soldiers and their network原创 2016-04-08 11:54:37 · 273 阅读 · 0 评论 -
HDU 4283 You Are the One 区间DP
题目描述:Description The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small hall, so原创 2016-05-04 19:15:21 · 337 阅读 · 0 评论 -
HDU 4293 Groups 区间覆盖 区间DP
题目描述:Description After the regional contest, all the ACMers are walking alone a very long avenue to the dining hall in groups. Groups can vary in size for kinds of reasons, which means, several play原创 2016-05-02 16:00:46 · 839 阅读 · 0 评论 -
POJ 1141 Brackets Sequence 括号匹配 区间DP
题目描述:DescriptionLet us define a regular brackets sequence in the following way: Empty sequence is a regular sequence. If S is a regular sequence, then (S) and [S] are both regular sequences. If A an原创 2016-05-02 13:51:55 · 340 阅读 · 0 评论 -
Light OJ 1031 Easy Game 区间DP
题目描述:Description You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take them alternatively. Each player can take one or more numbers原创 2016-04-30 22:03:11 · 381 阅读 · 0 评论 -
HDU 5001 Walk 概率DP入门!
题目描述:Problem Description I used to think I could be anything, but now I know that I couldn’t do anything. So I started traveling.The nation looks like a connected bidirectional graph, and I am randoml原创 2016-04-17 20:26:44 · 404 阅读 · 0 评论 -
HDU 4616 Game 树形DP 搜索
题目描述:Description Nowadays, there are more and more challenge game on TV such as ‘Girls, Rush Ahead’. Now, you participate int a game like this. There are N rooms. The connection of rooms is like a t原创 2016-03-28 21:11:15 · 316 阅读 · 0 评论 -
HDU 1520 Anniversary party 树形DP入门
题目描述:Problem Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the super原创 2016-03-28 16:58:09 · 271 阅读 · 0 评论 -
HDU 4323 Magic Number 编辑距离
题目描述:Description There are many magic numbers whose lengths are less than 10. Given some queries, each contains a single number, if the Levenshtein distance (see below) between the number in the query原创 2016-03-27 14:28:44 · 328 阅读 · 0 评论