动态规划
mirror58229
C++ Java Python+ACM算法learning
展开
-
HDU 5532 Almost Sorted Array(LIS讲解+二分)
Almost Sorted ArrayTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3328 Accepted Submission(s): 835Problem DescriptionWe ar原创 2016-10-05 01:03:49 · 453 阅读 · 0 评论 -
HDU 6092 Rikka with Subset(完全背包)
完全背包思想求解这题原创 2017-08-09 21:14:05 · 212 阅读 · 0 评论 -
HDU 1284 钱币兑换问题(完全背包)
换钱了还钱了原创 2017-08-09 20:46:13 · 284 阅读 · 0 评论 -
动态规划(01背包、完全背包、多重部分和、LCS、LIS、划分数、多重集组合数)
Learn and Review 动态规划入门原创 2017-03-19 16:03:13 · 1115 阅读 · 0 评论 -
POJ 3046 Ant Counting (dp 多重集组合数)
differ from the White Book原创 2017-05-09 22:01:22 · 320 阅读 · 0 评论 -
HDU 5119 Happy Matt Friends(dp)
Happy Matt FriendsTime Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 3047 Accepted Submission(s): 1203Problem DescriptionMatt原创 2016-10-07 17:49:26 · 409 阅读 · 0 评论 -
HDU 1003 Max Sum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5原创 2016-08-16 22:57:08 · 298 阅读 · 0 评论 -
HDU 2602 Bone Collector(01背包)
Problem 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 grav原创 2016-08-17 00:00:09 · 285 阅读 · 0 评论 -
HDU 1248 寒冰王座(完全背包)
Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!"地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水350块一个."死亡骑士:"好的,给我一个血瓶."说完他掏出那张原创 2016-08-17 18:00:27 · 344 阅读 · 0 评论 -
HDU 1423 Greatest Common Increasing Subsequence(动态规划+最长公共上升子序列)
Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. InputEach sequence is described with M - its length (1原创 2016-08-18 00:11:52 · 369 阅读 · 0 评论 -
HDU 1176 免费馅饼 (动态规划)
Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中原创 2016-08-18 00:32:11 · 2062 阅读 · 2 评论 -
HDU 2546 饭卡(01背包)
Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。 某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的余额,问最少可使卡上的余额为多少。 Inp原创 2016-08-28 23:36:21 · 473 阅读 · 0 评论 -
HDU 6092 Rikka with Subset(题解解释)
emmmm...传说中签到原创 2017-08-09 15:50:10 · 272 阅读 · 0 评论