文件名称:circlecutting
- 所属分类:
- 控制台(字符窗口)编程
- 资源属性:
- [C/C++] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 1kb
- 下载次数:
- 0次
- 提 供 者:
- 林*
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
集装箱的装箱问题
给定一个集装箱,其长为L,宽为W和高为H,现有一批圆柱形木材,每根木材的长均为L,但是半径不同,设第i根木材半径为ri。问如何装箱,使得集装箱的空间利用率最高?
本程序要求用贪心算法解决:
贪心算法总是作出在当前看来是最好的选择。也就是说,不从整体最优上加以考虑,它所做出的仅是在某种意义上的局部最优解。
-problem given a container, its long-L, width W and H for high, the existing batch of cylindrical wood, wood-per-L are, but different radius, based its i-ri radius of the wood. Asked how crates, containers make maximum utilization of space? The procedural requirements with greedy algorithm : greedy algorithm always make the current appears to be the best option. That is to say, not on the whole be considered optimal, it is made only in a sense, the local optimal solution.
给定一个集装箱,其长为L,宽为W和高为H,现有一批圆柱形木材,每根木材的长均为L,但是半径不同,设第i根木材半径为ri。问如何装箱,使得集装箱的空间利用率最高?
本程序要求用贪心算法解决:
贪心算法总是作出在当前看来是最好的选择。也就是说,不从整体最优上加以考虑,它所做出的仅是在某种意义上的局部最优解。
-problem given a container, its long-L, width W and H for high, the existing batch of cylindrical wood, wood-per-L are, but different radius, based its i-ri radius of the wood. Asked how crates, containers make maximum utilization of space? The procedural requirements with greedy algorithm : greedy algorithm always make the current appears to be the best option. That is to say, not on the whole be considered optimal, it is made only in a sense, the local optimal solution.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
circle1.cpp