题库练习 Vanya and Lanterns
← 上一题 下一题 →

A9723 | Vanya and Lanterns

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Vanya walks late at night along a straight street of length $l$ , lit by $n$ lanterns. Consider the coordinate system with the beginning of the street corresponding to the point $0$ , and its end corresponding to the point $l$ . Then the $i$ -th lantern is at the point $a_{i}$ . The lantern lights all points of the street that are at the distance of at most $d$ from it, where $d$ is some positive number, common for all lanterns.

Vanya wonders: what is the minimum light radius $d$ should the lanterns have to light the whole street?

输入格式

Vanya walks late at night along a straight street of length $l$ , lit by $n$ lanterns. Consider the coordinate system with the beginning of the street corresponding to the point $0$ , and its end corresponding to the point $l$ . Then the $i$ -th lantern is at the point $a_{i}$ . The lantern lights all points of the street that are at the distance of at most $d$ from it, where $d$ is some positive number, common for all lanterns.

Vanya wonders: what is the minimum light radius $d$ should the lanterns have to light the whole street?

输出格式

Print the minimum light radius $d$ , needed to light the whole street. The answer will be considered correct if its absolute or relative error doesn't exceed $10^{-9}$ .

输入输出样例

输入 #1
7 15
15 5 3 7 9 14 0
输出 #1
2.5000000000
输入 #2
2 5
2 5
输出 #2
2.0000000000
C++ 编辑器
输入
输出