![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
背包问题
MiniSheep_CS
编程者如上帝,可以创造万物。
展开
-
01背包,完全背包,多重背包详解
背包之01背包、完全背包、多重背包详解 PS:大家觉得写得还过得去,就帮我把博客顶一下,谢谢。首先说下动态规划,动态规划这东西就和递归一样,只能找局部关系,若想全部列出来,是很难的,比如汉诺塔。你可以说先把除最后一层的其他所有层都移动到2,再把最后一层移动到3,最后再把其余的从2移动到3,这是一个直观的关系,但是想列举出来是很难的,也许当层数n=3时还可以模拟下,再大一些就不可能了,所转载 2014-12-06 17:36:07 · 488 阅读 · 0 评论 -
hdu2955 Robberies(背包问题)
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13043 Accepted Submission(s): 4827Problem DescriptionThe aspiring Roy th原创 2014-12-06 21:11:03 · 485 阅读 · 0 评论 -
POJ1276 Cash Machine(动态规划)
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28982 Accepted: 10375DescriptionA Bank plans to install a machine for cash withdrawal. The m原创 2015-04-13 19:51:13 · 426 阅读 · 0 评论 -
POJ1837 Balance(动态规划)
BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11431 Accepted: 7127DescriptionGigel has a strange "balance" and he wants to poise it. Actually,原创 2015-04-13 19:58:09 · 327 阅读 · 0 评论 -
poj1014 Dividing(递归,多重背包)
DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 62888 Accepted: 16287DescriptionMarsha and Bill own a collection of marbles. They want to split原创 2015-05-30 15:43:23 · 911 阅读 · 5 评论