Codeforces - 492B. Vanya and Lanterns

题目链接：Codeforces - 492B. Vanya and Lanterns

搜索一遍就可以了

#include<string>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define ll long long

using namespace std;

const int MAXN = 1e3+7;
double INF = 1e9+7;
int n, l;
double a[MAXN];



int main()
{
    scanf("%d%d",&n, &l);
    for(int i = 0; i < n; i++) scanf("%lf", &a[i]);
    sort(a, a+n);
    double mind = -1;
    for(int i = 1; i < n; i++)
        mind = max(mind, (a[i] - a[i-1])/2.0);
    if(a[0] != 0) {
        mind = max(mind, a[0]);
    }
    if(a[n-1] != l) {
        mind = max(mind, l - a[n-1]);
    }
    printf("%.10lf\n", mind);
}