Codeforces Round 187 (Div. 1)
D
Sereja and Straight Lines
Codeforces
2500
原题
← CE →
翻译中…

Sereja placed $*n*$ points on a plane. Now Sereja wants to place on the plane two straight lines, intersecting at a right angle, so that one of the straight lines intersect the $*Ox*$ axis at an angle of $45$ degrees and the maximum distance from the points to the straight lines were minimum.

翻译中…

In this problem we consider the distance between points $(*x*_{1}, *y*_{1})$ and $(*x*_{2}, *y*_{2})$ equal $|*x*_{1} - *x*_{2}| + |*y*_{1} - *y*_{2}|$. The distance between the point and the straight lines is the minimum distance from the point to some point belonging to one of the lines.

翻译中…

Help Sereja, find the maximum distance from the points to the optimally located straight lines.

翻译中…

Input

翻译中…

The first line contains integer $*n*$ $(1 ≤ *n* ≤ 10^{5})$. Next $*n*$ lines contain the coordinates of the lines. The $*i*$-th line contains two integers $*x*_{*i*}, *y*_{*i*}$ $(|*x*_{*i*}|, |*y*_{*i*}| ≤ 10^{9})$.

翻译中…

Output

翻译中…

In a single line print a real number — the answer to the problem. Your answer will be considered correct iff its absolute or relative error doesn't exceed $10^{ - 6}$.

翻译中…

样例

Input #1
4
0 0
2 0
0 2
2 2
Output #1
0.000000000000000
InputCopy OutputCopy
Input #2
4
1 0
0 1
2 1
1 2
Output #2
1.000000000000000
InputCopy OutputCopy
题目信息
题号
314D
时间限制
2 s
内存限制
256 MB
标签
二分
数据结构
计算几何
排序
双指针

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。