文件名称:my0-1knapsack
介绍说明－－下载内容均来自于网络，请自行研究使用
给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W.
0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ．
用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum total value of the goods but a subset of the W capacity. Dynamic Programming
0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ．
用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum total value of the goods but a subset of the W capacity. Dynamic Programming
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 79419116my0-1knapsack.rar 列表 my0-1knapsack.cpp