codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

492B.md (1586B)


      1 Source: https://codeforces.com/problemset/problem/492/B
      2 
      3 B. Vanya and Lanterns
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 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 *a**i*. 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.
     22 
     23 Vanya wonders: what is the minimum light radius *d* should the lanterns have to light the whole street?
     24 
     25 Input
     26 
     27 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.
     28 
     29 The next line contains *n* integers *a**i* (0 ≤ *a**i* ≤ *l*). Multiple lanterns can be located at the same point. The lanterns may be located at the ends of the street.
     30 
     31 Output
     32 
     33 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.
     34 
     35 Examples
     36 
     37 Input
     38 
     39 ```
     40 7 15  
     41 15 5 3 7 9 14 0
     42 ```
     43 
     44 Output
     45 
     46 ```
     47 2.5000000000
     48 ```
     49 
     50 Input
     51 
     52 ```
     53 2 5  
     54 2 5
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 2.0000000000
     61 ```
     62 
     63 Note
     64 
     65 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.