zoukankan      html  css  js  c++  java
  • B题(覆盖问题)

     
     
    B - B
     
    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u
     

    Description

    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 nl (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.

    Sample Input

    Input
    7 15
    15 5 3 7 9 14 0
    Output
    2.5000000000
    Input
    2 5
    2 5
    Output
    2.0000000000

    Hint

    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.

    #include<iostream>
    #include<algorithm>
    #include<cstdio>
    #include<cmath>
    using namespace std;
    int n,l;
    double s,t,ans,r,u;
    int a[1005];
    int main()
    {
        cin>>n>>l;
        double f=0;
        for(int i=0; i<n; i++)
            cin>>a[i];
        sort(a,a+n);
        for(int i=0; i<n-1; i++)
        {
            ans=a[i+1]-a[i];
            if(f<ans)
                f=ans;
        }
        r=f/2;
        s=a[0];
        t=(l-a[n-1]);
        double u=max(s,t);
        double v=max(u,r);
        printf("%.10lf
    ",v);
    }
  • 相关阅读:
    约瑟夫环问题拓展 C/C++
    C/C++之STL简介
    详解约瑟夫环问题 C/C++
    HC-SR04超声波传感器
    TCRT5000 红外传感器
    win10的docker无法运行mysql的image,Public Key Retrieval is not allowed
    如何将docker默认的安装位置从C盘改为D盘?
    免费PDF阅读器
    A1B2B3
    动态代理
  • 原文地址:https://www.cnblogs.com/hfc-xx/p/4716131.html
Copyright © 2011-2022 走看看