beibaowenti
于 2009-05-07 发布
文件大小:1KB
0 106
下载积分: 1
下载次数: 1
代码说明:
有N件物品和一个容量为V的背包。第i件物品的费用是c,价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。(There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does not exceed the sum of the capacity of backpack, and the sum of the maximum value.)
下载说明:请别用迅雷下载,失败请重下,重下不扣分!
发表评论