Cross on a Plane
题号:NC232786
时间限制:C/C++/Rust/Pascal 5秒,其他语言10秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

Let us describe the “cross” shape on a plane. For this, first, we choose a square on the plane. Note that each square can be viewed as the intersection of two infinite stripes on the plane which are orthogonal to each other. These stripes have the same width which is equal to the square side, and each edge of each stripe contains one of the square sides. The cross is the union of these two stripes with the square in the center. The size of a cross is the side of its center square. There are a few important points marked on the plane. Find the cross of minimum possible size which contains all these points inside or on its border.

输入描述:

The first line contains an integer n: the number of important points on the plane (4 ≤ n ≤ 50). Eachof the next n lines contains two integers x_i and y_i : the coordinates of i-th point ( ≤ 10 000). Allgiven points are distinct. It is guaranteed that the minimum possible size of a cross containing all thesepoints is at least 1. 

输出描述:

A decimal. You only need to output the width of the square.
示例1

输入

复制
5
0 0
0 10
10 0
10 10
10 20

输出

复制
4.472135954329

说明

备注:

Your answer will right if your error no more than  .