CodeForces - 492B

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.

题意：在一条长为l的直路上有n个灯笼，求灯笼最小的照明半径使得路可以被全部照亮。

思路：有三种情况

            第一种：路尾和路首有灯，只需要考虑相邻两个灯笼之江最大的距离÷2。

            第二种：路尾或路首没有灯，求出相邻两个灯笼之江最大的距离÷2之后，比较                           路首到第一个灯笼的距离，路尾到第一个灯笼的距离，找到最大值。

代码：

#include<stdio.h>
#include<algorithm>
using namespace std;

int main()
{
    int n,l;
    double a[1010];
    while(~scanf("%d%d",&n,&l))
    {
        int i,j;
        double maxx=0;
        for(i=0 ; i < n; i ++)
            scanf("%lf",&a[i]);
        sort(a,a+n);
        for(i = 0; i < n; i ++)
        {
            if(i==0)
                continue;
            else
                maxx = max(maxx , a[i]-a[i-1]);
        }
        maxx/=2;
        maxx = max(maxx,l-a[n-1]);
        maxx = max(maxx,a[0]);
        printf("%.10lf\n",maxx);
    }
    return 0;
}