文件名称:01c++
介绍说明－－下载内容均来自于网络，请自行研究使用
一个旅行者有一个最多能用m公斤的背包，现在有n件物品，它们的重量分别是W1，W2，...,Wn,它们的价值分别为C1,C2,...,Cn.若每种物品只有一件求旅行者能获得最大总价值。
-A traveler can have a maximum of m kilograms of backpack, there are n items, and their respective weights are W1, W2 ,..., Wn, respectively, the value of their C1, C2 ,..., Cn. If Only one of each item for travelers to maximize the total value.
-A traveler can have a maximum of m kilograms of backpack, there are n items, and their respective weights are W1, W2 ,..., Wn, respectively, the value of their C1, C2 ,..., Cn. If Only one of each item for travelers to maximize the total value.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
01c++.txt