POJ1328解题报告

最新推荐文章于 2018-12-10 20:14:37 发布

少年织梦

最新推荐文章于 2018-12-10 20:14:37 发布

阅读量5.9k

点赞数 5

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

本文链接：https://blog.csdn.net/qq_33913037/article/details/72868491

版权

这是一篇关于POJ1328题目的解题报告，内容涉及海岸线上的雷达覆盖范围问题。给定海岸线、岛屿坐标及雷达覆盖距离d，目标是找出覆盖所有岛屿所需的最少雷达数量。对于无效的岛屿位置，如在海岸线下方或覆盖距离小于0，答案为-1。有效的岛屿会形成覆盖区间，并通过排序和合并重叠区间来确定最少雷达数。

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

每日一看

Radar Installation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 40799		Accepted: 9034

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 Inp