Codeforces Round #280 (Div. 2) B_html/css_WEB-ITnose
题目:
B. Vanya and *s
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Vanya walks late at night along a straight street of length l, lit by n *s. 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 * is at the point ai. The * 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 *s.
Vanya wonders: what is the minimum light radius d should the *s have to light the whole street?
Input
The first line contains two integers n, l (1?≤?n?≤?1000, 1?≤?l?≤?109) ? the number of *s and the length of the street respectively.
The next line contains n integers ai (0?≤?ai?≤?l). Multiple *s can be located at the same point. The *s may be located at the ends of the street.
Output
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.
Sample test(s)
input
7 1515 5 3 7 9 14 0
output
2.5000000000
input
2 52 5
output
2.0000000000
Note
Consider the second sample. At d?=?2 the first * will light the segment [0,?4] of the street, and the second * will light segment[3,?5]. Thus, the whole street will be lit.
分析:一个长l的街道,在一些指定点上会有一些灯笼,问灯笼最小照亮半径为多少可以照亮整条街。
处理下,相邻元素最大值,注意一下0 or L处没有灯笼的情况。
#include#include #include #include #include #include #include #include #include #include #include #include #include
推荐阅读
-
Codeforces Round #279 (Div. 2) 解题报告_html/css_WEB-ITnose
-
Codeforces Round #340 (Div. 2)-E-XOR and Favorite Number(莫队)
-
Codeforces Round #482 (Div. 2) D. Kuro and GCD and XOR and SUM(数学+01字典树)(好题)
-
Codeforces Round #553 (Div. 2) B. Dima and a Bad XOR(异或+思维)
-
Codeforces Round #246 (Div. 2) ?B. Football Kit_html/css_WEB-ITnose
-
Codeforces Round #261 (Div. 2)B. Pashmak and Flowers(容易)
-
Educational Codeforces Round 41 (Rated for Div. 2) E. Tufurama(树状数组+偏序)
-
Educational Codeforces Round 37 (Rated for Div. 2) E. Connected Components?(图论+连通块+bfs)
-
Educational Codeforces Round 66 (Rated for Div. 2)-E. Minimal Segment Cover
-
Educational Codeforces Round 65 (Rated for Div. 2) E. Range Deleting(双指针+思维)