算法课作业系列6——The Skyline Problem

最新推荐文章于 2020-03-30 14:42:40 发布

天学者

最新推荐文章于 2020-03-30 14:42:40 发布

阅读量1.4k

点赞数 3

分类专栏：算法文章标签：算法设计

本文链接：https://blog.youkuaiyun.com/qq_26003929/article/details/78177700

版权

本文介绍了如何解决The Skyline Problem，即根据建筑物的位置和高度生成城市天际线轮廓。解题思路包括将建筑物视为两个点并按横坐标排序，判断点的加入是否影响最高高度，以及处理右边界点。最后提供了源代码实现。

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

算法设计课作业系列（5）

The Skyline Problem

题目展示

A city’s skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locations and height of all the buildings as shown on a cityscape photo (Figure A), write a program to output the skyline formed by these buildings collectively (Figure B).

Buildings Skyline Contour
The geometric information of each building is represented by a triplet of integers [Li, Ri, Hi], where Li and Ri are the x coordinates of the left and right edge of the ith building, respectively, and Hi is its height. It is guaranteed that 0 ≤ Li, Ri ≤ INT_MAX, 0 < Hi ≤ INT_MAX, and Ri - Li > 0. You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.

For instance, the dimensions of all buildings in Figure A are recorded as: [ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ] .

The output is a list of “key points” (red dots in Figure B) in the format of [ [x1,y1], [x2, y2], [x3, y3], ... ] that uniquely defines a skyli