492B - Vanya and Lanterns
来源:互联网 发布:如何删除mac里的照片 编辑:程序博客网 时间:2024/05/13 22:06
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?
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.
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.
7 1515 5 3 7 9 14 0
2.5000000000
2 52 5
2.0000000000
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.
import java.util.*;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n = sc.nextInt(); int l = sc.nextInt(); int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=sc.nextInt(); Arrays.sort(a); int m = a[0]>l-a[n-1]?a[0]*2:(l-a[n-1])*2; for(int i =0;i< n-1 ;i++) m = m>a[i+1]-a[i]?m:a[i+1]-a[i]; java.text.DecimalFormat df=new java.text.DecimalFormat(".0000000000"); System.out.println(df.format(m/2.0)); }}
- 492B - Vanya and Lanterns
- B. Vanya and Lanterns
- B - Vanya and Lanterns
- B - Vanya and Lanterns
- Codeforces 492B. Vanya and Lanterns 二分
- Codeforces 492B Vanya and Lanterns(水)
- coderforce 492B Vanya and Lanterns
- Codeforces-492B-Vanya and Lanterns
- Codeforces 492B Vanya and Lanterns【贪心】
- codeforce492 B. Vanya and Lanterns
- codeforces #492B# Vanya and Lanterns(贪心)
- CodeForces 492B Vanya and Lanterns(水题)
- codeforces——492B——Vanya and Lanterns
- Codefroces 280 div2 B. Vanya and Lanterns
- CF 280B. Vanya and Lanterns(div2)
- Vanya and Lanterns
- Vanya and Lanterns
- CF_492B Vanya and Lanterns
- 《数据结构》实验五: 树和二叉树实验
- 与网络相关的基础知识
- WinForm之中BindingNavigator控件的使用
- UVA11464 Even Parity
- 使用PHP composer创建Symfony2框架项目
- 492B - Vanya and Lanterns
- C++之“友元类”学习笔记
- -2147483648
- 设置路由器上网
- UIButton无图实现背影色
- mysql 常用命令
- Iterator
- 正在解析主机
- DataGridView分页功能的实现<纯手动方式>