动态规划
GYD_01
这个作者很懒,什么都没留下…
展开
-
Piggy-Bank-HDU1114-完全背包
Piggy-BankProblem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound M原创 2017-11-19 20:48:39 · 286 阅读 · 0 评论 -
HDU-3449-Consumer(有依赖背包)
ConsumerProblem DescriptionFJ is going to do some shopping, and before that, he needs some boxes to carry the different kinds of stuff he is going to buy. Each box is assigned to carry some specific k...原创 2018-05-03 15:42:37 · 265 阅读 · 0 评论 -
HDU-3535-AreYouBusy(分组背包)
AreYouBusyProblem DescriptionHappy New Term!As having become a junior, xiaoA recognizes that there is not much time for her to AC problems, because there are some other things for her to do, which mak...原创 2018-05-02 21:14:41 · 172 阅读 · 0 评论 -
HDU-2084-数塔(dp入门)
数塔Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个DP的题目,你能AC吗? Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1 <= N <= 100),表示数塔的高...原创 2018-04-13 15:31:52 · 216 阅读 · 0 评论 -
第七届省赛-Rectangles(dp)
Rectangles题目描述 Given N (4 <= N <= 100) rectangles and the lengths of their sides ( integers in the range 1..1,000), write a program that finds the maximum K for which there is a sequenc...原创 2018-04-18 19:58:23 · 123 阅读 · 0 评论 -
第七届省赛-物资调度(dp)
物资调度题目描述某地区发生了地震,灾区已经非常困难,灾民急需一些帐篷,衣物,食品和血浆等物资。可通往灾区的道路到处都是塌方,70%以上的路面损坏,桥梁全部被毁。国家立即启动应急预案,展开史上最大强度的非作战式的空运行动,准备向灾区投放急需物资。一方有难,八方资源。现在已知有N个地方分别有A1,A2......An个物资可供调配,目前灾区需要物资数量为M。现在,请你帮忙算一算,总共有多少种物资调度方...原创 2018-04-18 15:07:20 · 145 阅读 · 0 评论 -
HDU-1087-Super Jumping! Jumping! Jumping!(dp)
Super Jumping! Jumping! Jumping!Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this...原创 2018-04-11 16:59:23 · 366 阅读 · 0 评论 -
HDU-2079-选课时间-多重背包
选课时间(题目已修改,注意读题)Problem Description又到了选课的时间了,xhd看着选课表发呆,为了想让下一学期好过点,他想知道学n个学分共有多少组合。你来帮帮他吧。(xhd认为一样学分的课没区别) Input输入数据的第一行是一个数据T,表示有T组数据。每组数据的第一行是两个整数n(1 <= n <= 40),k(1 <= k <= 8)。接着有k行,每行...原创 2018-04-10 16:56:21 · 557 阅读 · 0 评论 -
HDU-1059 Dividing(多重背包)
DividingProblem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all...原创 2018-03-05 20:57:22 · 181 阅读 · 0 评论 -
HDOJ1300-Pearls
PearlsProblem DescriptionIn Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to...原创 2018-03-05 20:36:44 · 157 阅读 · 0 评论 -
Big Event in HDU -背包问题
Big Event in HDUProblem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Comput原创 2017-11-04 20:13:48 · 524 阅读 · 0 评论 -
Bone Collector -简单01背包
Bone CollectorProblem 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 h原创 2017-11-04 20:16:31 · 350 阅读 · 0 评论 -
HDU 2159-FATE-背包
FATEProblem Description最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感,但又不得不通过杀怪来升完这最后一级。现在的问题是,xhd升掉最后一级还需n的经验值,xhd还留有m的忍耐度,每杀一个怪xhd会得到相应的经验,并减掉相应的忍耐度。当忍耐度降到0或者0以下时,xhd就不会玩这游原创 2017-11-18 21:08:26 · 227 阅读 · 0 评论