【题解】poj3714 分治法求平面最近点对

最新推荐文章于 2021-02-25 20:01:33 发布

wwt9b15bs

最新推荐文章于 2021-02-25 20:01:33 发布

阅读量819

点赞数

分类专栏：算法竞赛进阶指南 poj 分治文章标签：分治平面最近点对

本文链接：https://blog.csdn.net/qq_41958841/article/details/82460676

版权

该博客主要介绍如何使用分治法解决一道编程题——求解平面中的最近点对。在帝国防线被攻破后，为了找出最接近核能电站的特工，需要计算每个特工到电站的最小距离。博客提供了输入输出示例，并强调在输出结果时的精度问题，以及在编程中遇到的浮点数格式输出陷阱。

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

题目链接

Description

After successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire repelled the six waves of Union’s attack. After several sleepless nights of thinking, Arthur, General of the Union, noticed that the only weakness of the defense system was its energy supply. The system was charged by N nuclear power stations and breaking down any of them would disable the system.

The general soon started a raid to the stations by N special agents who were paradroped into the stronghold. Unfortunately they failed to land at the expected positions due to the attack by the Empire Air Force. As an experienced general, Arthur soon realized that he needed to rearrange the plan. The first thing he wants to know now is that which agent is the nearest to any power station. Could you, the chief officer, help the general to calculate the minimum distance between an agent and a station?

Input

The first line is a integer T representing the number of test cases.
Each test case begins with an integer N (1 ≤ N ≤ 100000).
The next N lines describe the positions of the stations. Each