背包问题
这条街上最靓的妞儿
这个作者很懒,什么都没留下…
展开
-
Space Elevator
The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build the tow转载 2017-12-02 16:13:41 · 681 阅读 · 0 评论 -
Knapsack problem
Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total weight is less than or equal to a given limit B and the total原创 2018-01-27 23:09:11 · 246 阅读 · 0 评论 -
51 nod 1086 背包问题 V2 (多重背包DP)
1086 背包问题 V2 基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注有N种物品,每种物品的数量为C1,C2......Cn。从中任选若干件放在容量为W的背包里,每种物品的体积为W1,W2......Wn(Wi为整数),与之相对应的价值为P1,P2......Pn(Pi为整数)。求背包能够容纳的最大价值。Input第1行,2个整数,N和W中间用空格...原创 2018-04-28 16:07:17 · 117 阅读 · 0 评论