greedy

代码说明：

  集装箱的装箱问题: *给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材 *的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装 *箱的空间利用率最高？使用贪心算法解决。 *编译方法：打开cpp文件，在编译的同时建立工程,打开 "settings->link" *在link项的Object/library modules:中加入Opengl32.lib glu32.lib glaux.lib(Container packing problem: given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber* long are L, but the radius is different for the first i-kan timber radius ri. Asked how the packing, making me be assembled in* the maximum utilization of space? Use greedy algorithm to solve.* Compiler Methods: Open cpp file, compiled at the same time in the establishment of the project, open the settings-)

文件列表：

c25.txt
c30.txt
greedy.cpp
greedy.exe
注意事项.txt