Codeforces-492B-Vanya and Lanterns
来源:互联网 发布:淘宝大学哪个学院好 编辑:程序博客网 时间:2024/05/24 04:58
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 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.
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<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int main(){ int n,l; int a[1005]; while(scanf("%d%d",&n,&l)!=EOF) { for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); double ans=max(a[0],l-a[n-1]); for(int i=1;i<n;i++) { ans=max(ans,(a[i]-a[i-1])/2.0); } printf("%.10lf\n",ans); } return 0;}
- Codeforces 492B. Vanya and Lanterns 二分
- Codeforces 492B Vanya and Lanterns(水)
- Codeforces-492B-Vanya and Lanterns
- Codeforces 492B Vanya and Lanterns【贪心】
- 492B - Vanya and Lanterns
- codeforces #492B# Vanya and Lanterns(贪心)
- CodeForces 492B Vanya and Lanterns(水题)
- codeforces——492B——Vanya and Lanterns
- codeforces Vanya and Lanterns
- Codeforces Vanya and Lanterns
- B. Vanya and Lanterns
- B - Vanya and Lanterns
- B - Vanya and Lanterns
- coderforce 492B Vanya and Lanterns
- codeforce492 B. Vanya and Lanterns
- Codeforces Round 280 Div2 B Vanya and Lanterns(binary serch)
- (Vanya and Lanterns)Codeforces Round #280 (Div. 2)B
- Vanya and Lanterns( Codeforces Round #280 (Div. 2)B)
- LIGHT OJ 1179 - Josephus Problem【约瑟夫(模板)】
- cancel事件
- 嵌入式培训第二阶段 第一星期 no.1 标准 I / O
- How to install Oh My Zsh on Ubuntu 14
- jmeter(三)maven 和jenkins
- Codeforces-492B-Vanya and Lanterns
- 使用WireShark分析HTTP协议时几种常见的汉字编码
- String和StringBuffer类
- 左移右移的思考
- Service
- 工具使用:git
- LeetCode53. Maximum Subarray 动态规划和分治法
- DSAA Homework 2
- 一些matlab程序的实现