CF - 492B. Vanya and Lanterns 排序

1.题目描述：

B. Vanya and Lanterns

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 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 ai. 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?

Input

The first line contains two integers n, l (1 ≤ n ≤ 1000, 1 ≤ l ≤ 109) — the number of lanterns and the length of the street respectively.

The next line contains n integers ai (0 ≤ ai ≤ l). Multiple lanterns can be located at the same point. The lanterns 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.

Examples

input

7 15
15 5 3 7 9 14 0

output

2.5000000000

input

2 5
2 5

output

2.0000000000

Note

Consider the second sample. At d = 2 the first lantern will light the segment [0, 4] of the street, and the second lantern will light segment [3, 5]. Thus, the whole street will be lit.

2.题意概述：

一条街道上有若干个路灯，要你求路灯亮度的半径最少要多少能把这条街照亮

3.解题思路：

直接搜任意两条灯最大距离，特判一下头和尾就行，其实还可以二分答案来判断，复杂度也是O(N)，姿势都是对的，当时水题场我是用的排序（毕竟当时刚集训排序），二分做法以后补上

4.AC代码：

#include <stdio.h>
#include <algorithm>
#define N 1010
using namespace std;
int n, l;
double a[N];
int main()
{
	scanf("%d %d", &n, &l);
	for (int i = 0; i<n; i++)
		scanf("%lf", &a[i]);
	sort(a, a + n);
	double minx = 0;
	for (int i = 1; i < n; i++)
	{
		if (a[i - 1] == a[i])
			continue;
		minx = max(minx, a[i] - a[i - 1]);
	}
	minx = max(minx / 2, max(a[0], l - a[n - 1]));
	printf("%f\n", minx);
	return 0;
}