A9000 | Sereja and Straight Lines
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
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})$ .
输出格式
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}$ .
输入输出样例
输入 #1
4 0 0 2 0 0 2 2 2
输出 #1
0.000000000000000
输入 #2
4 1 0 0 1 2 1 1 2
输出 #2
1.000000000000000
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted