摘要： The Greedy algorithm is a simple,direct and efficient method to many problems. In this paper,the longest nesting problem of d-dimension boxes is brought up firstly. And then a novel algorithm for this problem based on greedy strategy is proposed. Finally,

关键词: 贪心算法 排序方法 时间复杂度 最长d维箱嵌套问题 计算机