![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
背包问题
active2489595970
ACM爱好者,开发爱好者,分享成长经验,分享开发经验
展开
-
01背包问题
什么是01背包问题呢?下面是弱的理解~~~~~ 01背包:0背包是指在n件物品中取出若干件放在空间为V的背包里,每件物品的体积为v1,v2,v3……v(n),与之对应的价值为p1,p2,p3……p(n),求在不超过背包容量的情况下,获得最大价值的方案? 01背包有个特点哟:每种物品只有一件,可以选择放或者不放 状态转移方程:F[i][V]=max{F[i-1][V],F[i-1][V-v[i原创 2017-02-22 08:21:56 · 296 阅读 · 0 评论 -
hdu2660
Accepted Necklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3836 Accepted Submission(s): 1526 Problem Description I have N pre原创 2017-06-25 12:31:55 · 223 阅读 · 0 评论 -
hdu2602
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 61900 Accepted Submission(s): 25802 Problem Description Many years ag原创 2017-06-23 20:56:32 · 173 阅读 · 0 评论