动态规划（完全背包的变形）

最新推荐文章于 2022-04-06 19:40:05 发布

sky_zdk

最新推荐文章于 2022-04-06 19:40:05 发布

阅读量546

点赞数

分类专栏： ACM poj 文章标签：动态规划 poj C语言动态规划

本文链接：https://blog.csdn.net/sky_zdk/article/details/57409071

版权

该博客主要介绍了如何使用动态规划解决POJ2392问题，这是一个涉及完全背包变形的问题。通过C语言实现，博主首先定义了Block结构体，然后使用快速排序优化处理，最后展示了一个动态规划的递推过程，找到最优解。

摘要由CSDN通过智能技术生成

poj2392

Space Elevator

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11437		Accepted: 5446

Description

The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build the tower. Each block of type i has height h_i (1 <= h_i <= 100) and is available in quantity c_i (1 <= c_i <= 10). Due to possible damage caused by cosmic rays, no part of a block of type i can exceed a maximum altitude a_i (1 <= a_i <= 40000).

Help the cows build the tall