文件名称:Minimum-backpack
-
所属分类：
- 标签属性：
- 上传时间：2013-03-31
-
文件大小：2.3kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
假设有许多盒子，每个盒子能保存的总重量为1.0。有N个项i1,i2,…,iN，它们的重量分别是w1,w2,…,wN。
目的是用尽可能少的盒子放入所有的项，任何盒子的重量不能超过他的容量。-Suppose there are many box, each box can be saved on the total weight of 1.0. N items I1, I2, ..., IN, the weight of them are w1, w2, ..., Wn. The purpose is to put all the items, any weight of the box can not exceed his capacity as few boxes as possible.
目的是用尽可能少的盒子放入所有的项，任何盒子的重量不能超过他的容量。-Suppose there are many box, each box can be saved on the total weight of 1.0. N items I1, I2, ..., IN, the weight of them are w1, w2, ..., Wn. The purpose is to put all the items, any weight of the box can not exceed his capacity as few boxes as possible.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
MinBagProblem1.cpp
MinBagProblem1.h
MinBagProblemTest1.cpp
out1.txt
in.txt
MinBagProblem1.h
MinBagProblemTest1.cpp
out1.txt
in.txt
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。