![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM--动态规划
Lila_老妖
爱与和平.
展开
-
hdu -2602(01背包DP)Bone Collector
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 58078 Accepted Submission(s): 24221Problem DescriptionMany years ago , in Teddy...原创 2017-03-15 21:11:30 · 184 阅读 · 0 评论 -
hdu 2955(01背包问题)Robberies
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22509 Accepted Submission(s): 8317Problem DescriptionThe aspiring Roy the Robber has...原创 2017-03-15 18:12:39 · 201 阅读 · 0 评论 -
CodeForces 536A---Tavas and Karafs(二分)
Tavas and KarafsTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uCodeForces 536ADescriptionKarafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis p...原创 2017-04-11 21:44:21 · 313 阅读 · 0 评论 -
袋鼠过河
四月,脑不够.(可能是很久没有做题了,然后脑子有点退化,以后要好好努力~才能不那么费劲)题目描述一只袋鼠要从河这边跳到河对岸,河很宽,但是河中间打了很多桩子,每隔一米就有一个,每个桩子上都有一个弹簧,袋鼠跳到弹簧上就可以跳的更远。每个弹簧力量不同,用一个数字代表它的力量,如果弹簧力量为5,就代表袋鼠下一跳最多能够跳5米,如果为0,就会陷进去无法继续跳跃。河流一共N米宽,袋鼠初始位置就在第一个弹簧上...原创 2018-05-12 12:08:39 · 135 阅读 · 0 评论