Cf Edu 15 C 城市与信号塔[二分]

最新推荐文章于 2021-08-13 12:13:29 发布

xgogoforit

最新推荐文章于 2021-08-13 12:13:29 发布

阅读量757

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/xgogoforit/article/details/52076252

版权

本文介绍了如何使用C++解决Codeforces上的一道编程问题，即找到覆盖所有城市的最小信号塔覆盖范围。通过二分查找策略，确定每个城市与最近信号塔的距离，并确保所有城市都在覆盖范围内。

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

题目连接

http://codeforces.com/contest/702/problem/C

Description

You are given n points on the straight line — the positions (x-coordinates) of the cities and m points on the same line — the positions (x-coordinates) of the cellular towers. All towers work in the same way — they provide cellular network for all cities, which are located at the distance which is no more than r from this tower.

Your task is to find minimal r that each city has been provided by cellular network, i.e. for each city there is at least one cellular tower at the distance which is no more than r.

If r = 0 then a tower provides cellular network only for the point where it is located. One tower can provide cellular network for any number of cities, but all these cities must be at the distance which is no more than r from this tower.