文件名称:01c++
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.1kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
一个旅行者有一个最多能用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
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.