B. Vanya and Lanterns

##B. Vanya and Lanterns
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int Comp(const void*a,const void*b)
{
return *(int*)b-*(int*)a;
}
int a[1005];
int main()
{
	int n,l,j,i=0,min=0,sum1=0;
	double aver,sum,max=0;
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	qsort(a,n,sizeof(int),Comp);
	if(a[0]!=l)
	{
		max=l-a[0];//当第一个不是l时，即最边上没有灯
	}
	for(i=1;i<n;i++)
	{
		sun=a[i-1]-a[i];
		sum/=2;
		if(sum>max)
		{
			max=sum;
		}
	}
	if(a[n-1]!=0)
	{
		sum=a[n-1];//最后一位置没有灯
	}
	if(sum>max)
	{
		max=sum;
	}
	printf("%.10f\n",max);
	return 0;		
}