![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
[kuangbin带你飞]专题十二 基础DP
文章平均质量分 85
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
[kuangbin带你飞]专题十二 基础DP1
hdu 1024 Max Sum Plus Plus(DP缓存)Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult prob原创 2017-12-10 12:17:56 · 396 阅读 · 0 评论 -
HDU 1114 Piggy-Bank (完全背包)
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5726 Accepted Submission(s): 2878Problem DescriptionBefore ACM原创 2017-12-12 11:43:23 · 242 阅读 · 0 评论 -
hdu1176免费馅饼(数塔问题,动态规划)
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26971 Accepted Submission(s): 9186Problem Description都说天上不会掉馅饼,但有一天game原创 2017-12-12 13:21:47 · 717 阅读 · 1 评论 -
HDU 1160 FatMouse's Speed(LIS)
Problem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as p原创 2017-12-13 19:11:48 · 237 阅读 · 0 评论 -
POJ 1661 Help Jimmy (只能根据上面的坐标往下DP)
Description"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy落到某个平台上时,游戏者选择让它向左还是向右跑,它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时,开始继续下落。Ji原创 2017-12-14 14:45:56 · 401 阅读 · 0 评论 -
POJ3186:Treats for the Cows(区间DP)
DescriptionFJ has purchased N (1 The treats are interesting for many reasons:The treats are numbered 1..N and stored sequentially in single file in a long box that is open at both ends. On原创 2017-12-15 11:41:54 · 219 阅读 · 0 评论 -
HDU1078:FatMouse and Cheese(记忆化)
Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e原创 2017-12-15 12:17:29 · 207 阅读 · 0 评论 -
HDU 2859 Phalanx(用DP数组减少遍历的范围)
Problem DescriptionToday is army day, but the servicemen are busy with the phalanx for the celebration of the 60th anniversary of the PRC.A phalanx is a matrix of size n*n, each element is a cha原创 2017-12-15 19:59:38 · 277 阅读 · 0 评论 -
poj 3666 Making the Grade(dp离散化)
DescriptionA straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond o原创 2017-12-17 13:07:27 · 247 阅读 · 0 评论