文件名称:backpack-problem
- 所属分类：
- 数据库编程
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2015-11-23
- 文件大小：
- 1.01mb
- 下载次数：
- 0次
- 提 供 者：
- min****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
简单的背包问题：
有N件物品和一个容量为V的背包。第i件物品的重量是w[i]。在给定的背包容量的前提下，将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且装进去的物品数量最多。-Simple knapsack problem: there are N items and a capacity of V backpack. By weight of the i-th items that w [i]. Under the premise of a given backpack capacity, which will make the sum of the items into the backpack weight of these items does not exceed the capacity of the backpack, and loaded into the maximum number of items.
有N件物品和一个容量为V的背包。第i件物品的重量是w[i]。在给定的背包容量的前提下，将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且装进去的物品数量最多。-Simple knapsack problem: there are N items and a capacity of V backpack. By weight of the i-th items that w [i]. Under the premise of a given backpack capacity, which will make the sum of the items into the backpack weight of these items does not exceed the capacity of the backpack, and loaded into the maximum number of items.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
背包
....\Cpp1.cpp
....\Cpp1.dsp
....\Cpp1.dsw
....\Cpp1.ncb
....\Cpp1.opt
....\Cpp1.plg
....\Debug
....\.....\Cpp1.exe
....\.....\Cpp1.ilk
....\.....\Cpp1.obj
....\.....\Cpp1.pch
....\.....\Cpp1.pdb
....\.....\vc60.idb
....\.....\vc60.pdb