![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划初步
thesprit
譬如朝露 去日苦多
展开
-
【HDU2602】Bone Collector(01背包入门级)
DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave … The bon原创 2016-03-22 21:25:22 · 185 阅读 · 0 评论 -
【HDU2048】数塔(简单动态规划/DP)
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20786 Accepted Submission(s): 12486Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下原创 2016-07-20 16:49:01 · 494 阅读 · 0 评论 -
【HDU1114】Piggy-Bank(完全背包)
**Piggy-Bank**Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20204 Accepted Submission(s): 10266Problem DescriptionBefore ACM can do anythi原创 2016-07-18 20:01:09 · 355 阅读 · 0 评论 -
【HDU 1203】 I NEED A OFFER!(01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没原创 2016-07-27 16:28:35 · 252 阅读 · 0 评论 -
【HDU 1208】Pascal's Travels(动态规划DP)
HDU 1208Pascal’s TravelsDescriptionAn n x n game board is populated with integers, one nonnegative integer per square. The goal is to原创 2016-07-27 16:12:56 · 347 阅读 · 2 评论 -
【POJ2533】Longest Ordered Subsequence(LIS-最长上升子序列/DP)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KDescriptionA numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence (a1, a2, …,原创 2016-07-25 20:25:53 · 286 阅读 · 1 评论 -
【HDU1159】Common Subsequence(LCS/DP)
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possi原创 2016-07-25 20:08:10 · 285 阅读 · 0 评论 -
【HDU1422】重温世界杯(简单动态规划)
重温世界杯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description世界杯结束了,意大利人连本带利的收回了法国人6年前欠他们的债,捧起了大力神杯,成就了4星意大利. 世界杯虽然结束了,但是这界世界杯给我们还是留下许多值得回忆的东西.比如我们听到了黄名嘴的原创 2016-07-25 19:53:03 · 272 阅读 · 0 评论 -
【HDU1176】免费馅饼(类数塔问题)
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了原创 2016-07-25 19:47:26 · 319 阅读 · 0 评论 -
【HDU2191】悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包/简单DP)
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description急!灾区的食物依然短缺! 为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大原创 2016-07-25 19:17:30 · 200 阅读 · 0 评论 -
【POJ3624】Charm Bracelet(01背包)
DescriptionBessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm原创 2016-03-22 21:43:37 · 207 阅读 · 0 评论 -
【HDU2546】饭卡(01背包)
Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。 HDU2546原创 2016-03-22 21:39:10 · 249 阅读 · 0 评论 -
【HDU3466】Proud Merchants(01背包)
DescriptionRecently, iSea went to an ancient country. HDU3466原创 2016-03-22 21:32:36 · 285 阅读 · 0 评论 -
【HDU1231】最大连续子序列(简单动态规划)
最大连续子序列Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription给定K个整数的序列{ N1, N2, …, NK },其任意连续子序列可表示为{ Ni, Ni+1, …, Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个,原创 2016-07-20 17:20:37 · 329 阅读 · 0 评论