Codeforces 492B Vanya and Lanterns【贪心】

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.

题目大意：

现在有一条路，起点是0，终点是l，从起点到终点一共有N个路灯，让你分配给路灯一个最小照明半径，使得整条路都是亮的。

思路：

1、如果我们此时只有两个路灯，而且只想照明这两个路灯之间这段距离的路话.那么对应只要设定这两个路灯的半径为其距离/2即可。

2、那么如果我们此时有N个路灯，只考虑照亮从第一个路灯到最后一个路灯之间的这段距离的话，那么我们只需要找到最大距离差那段距离，然后设定每个路灯的照明半径为那段距离/2即可，记录此时ans。

3、但是我们现在有个起点有一个终点，那么如果这两个位子上没有路灯的话，那么对应第一个路灯需要照明的半径就是max（ans，从起点到第一个路灯的距离）。同理，那么对应最后一个路灯需要照明的半径就是max（ans，从终点到最后一个路灯的距离）。

取最大即可，就是最终的分配最小半径。如果起点和终点有路灯的话，那么按照有路灯计算即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
double a[10005];
int main()
{
    int n,l;
    while(~scanf("%d%d",&n,&l))
    {
        a[0]=0;
        a[n+1]=double (l);
        for(int i=1;i<=n;i++)
        {
            scanf("%lf",&a[i]);
        }
        sort(a+1,a+1+n);
        double output=0;
        for(int i=1;i<=n+1;i++)
        {
            if(i==1||i==n+1)
            {
                output=max(output,a[i]-a[i-1]);
            }
            else output=max(output,(a[i]-a[i-1])*1.0/2*1.0);
        }
        printf("%lf\n",output);
    }
}