ACM求路灯照射的最小半径问题
2015-08-07 20:04
351 查看
---恢复内容开始---
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
Output
Input
Output
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.
[b]解题思路:[/b]
[b]这个题目的大意是给定一条路的路灯数及路灯的位置,还有这条路的长度,让我们求这些灯可以照亮这条路的最小半径。我们可以将路灯的位置进行一个从小到大的排序。然后通过比较求出两个路灯相隔距离的最大值(直径)。记住还要将第一个路灯与0的距离求出和将最后一个路灯与路最后的位置的距离求出(半径),最然后取出其中半径的最小值。[/b]
程序代码:
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.
[b]解题思路:[/b]
[b]这个题目的大意是给定一条路的路灯数及路灯的位置,还有这条路的长度,让我们求这些灯可以照亮这条路的最小半径。我们可以将路灯的位置进行一个从小到大的排序。然后通过比较求出两个路灯相隔距离的最大值(直径)。记住还要将第一个路灯与0的距离求出和将最后一个路灯与路最后的位置的距离求出(半径),最然后取出其中半径的最小值。[/b]
程序代码:
#include <iostream> using namespace std; int a[100005]; int main() { int n,s=0,w=0,v=0; cin>>n; for(int i=0;i<n;i++) { cin>>a[i]; s=s+a[i]; } for(int u=0;u<n;u++) { v=v+a[u]; if(v==s-v) w++; } if(s) cout<<w<<endl; else cout<<w-1<<endl; return 0; }
相关文章推荐
- Android(java)学习笔记143:android提供打开各种文件的API接口:setDataAndType
- 我的明天在何处
- servlet
- git 常用命令
- 使用xib封装一个自定义view的步骤
- hdu5277 YJC counts stars(最大团)
- Android 应用程序窗体显示状态操作(requestWindowFeature()的应用
- [淘宝经验] - HBASE在淘宝网的应用和优化小结
- POJ 1011 Sticks dfs+剪枝
- POJ-2864 Pascal Library-年年参加聚会
- 2015 Multi-University Training Contest 6
- 拼图汇总
- Linux 简介
- Interleaving String
- jdk1.5新特性之自动装箱与拆箱
- oracle中sql语句的优化(转帖)
- Binary Tree Level Order Traversal I & II
- 定位图像中正方形区域
- something about set the FSDB file
- jdk1.5新特性之增强for循环