poj1328题（雷达覆盖小岛问题）

觅己本心

于 2017-03-24 15:03:05 发布

阅读量1.4k

点赞数

CC 4.0 BY-SA版权

分类专栏：贪心文章标签： poj

本文链接：https://blog.csdn.net/sinat_37848482/article/details/65631074

这篇博客介绍了如何解决POJ1328题，即在无限直海岸线上，利用覆盖距离为d的雷达最小数量覆盖所有位于海平面上的小岛。通过建立笛卡尔坐标系，对岛屿的位置和雷达覆盖范围进行分析，提出了一个解决方案：按岛屿的左交点排序，遍历过程中判断相邻岛屿的区间是否有重合，从而确定所需雷达的最小数量。

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

Radar Installation
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 34841 Accepted: 7737
Description
Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius installation, if the distance between them is at most d.

We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.

Figure A Sample Input of Radar Installations