【hdu 2795】Billboard 【线段树训练 3】

最新推荐文章于 2019-08-06 20:16:10 发布

真·skysys

最新推荐文章于 2019-08-06 20:16:10 发布

阅读量480

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数学

请明确标注出处

本文链接：https://blog.youkuaiyun.com/qq_33583069/article/details/52057435

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

本文介绍了一道编程题目，涉及一个大学入口处的矩形公告板，公告板上有一定尺寸且高度固定为1的公告条。新公告会尽可能顶部放置并左对齐。题目要求根据公告板尺寸和公告宽度，输出公告放置的行数。当无法放置公告时，输出-1。解决方案中提到使用线段树来优化问题求解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18769 Accepted Submission(s): 7877

Problem Description
At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are posted: nearest programming competitions, changes in the dining room menu, and other important information.

On September 1, the billboard was empty. One by one, the announcements started being put on the billboard.

Each announcement is a stripe of paper of unit height. More specifically, the i-th announcement is a rectangle of size 1 * wi.

When someone puts a new announcement on the billboard, sh

了解本专栏