hdoj 1007 Quoit Design【分治法+平面最近点对】

Mosu_

于 2019-11-02 21:16:24 发布

阅读量274

点赞数

分类专栏：基础题目

本文链接：https://blog.csdn.net/Mosu_/article/details/102876579

版权

该博客讨论了如何利用分治法解决一个在Cyberground游戏中找到最大半径环以包围所有玩具的问题。内容涉及到平面最近点对的计算，指出当两个玩具坐标相同时，环的半径为0。博客提供了一个样例输入和输出，并提到在合并分治结果时的特殊情况，即左半部分的一个点与右半部分的点之间的距离小于当前最小距离时，右半部分可能最多只有6个点。尽管存在证明，但博主没有在代码中使用这一特性，而是参照了其他解决方案。

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

Problem Description

Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a time. On the other hand, to make the game look more attractive, the ring is designed to have the largest radius. Given a configuration of the field, you are supposed to find the radius of such a ring.

Assume that all the toys are points on a plane. A point is encircled by the ring if the distance between the point and the center of the ring is strictly less than the radius of the ring. If two toys are placed at the same point, the radius of the ring is considered to be 0.

Input

The input consists of several test cases. For each case, the first line contains an integer N (2 <= N <= 100,000), the total number of toys in the field. Then