| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
This problem has a tag binary-search and also on a2oj ladder it's given under binary search. Div2 : B http://mirror.codeforces.com/contest/492/problem/B
I solved it by plain sorting the array and finding the max difference as given in the editorial.
But, I would like to know how to solve this by binary search? Any hints/pointers please? I am curious to do this with a new approach.
First of all add 0 and l(length of the street) in array(if they are not exist). Then sort it. Now use the binary search. Assume that middle of ours range is minimum radius. Then we go trough the array and check whether ours "middle point" is fit. If is it, then high = mid, else low = mid.
(Sorry for my poor English)
Hi, Thanks a lot for your help. :) Submitted using binary search . 19285506
It is fully commented, if you have any suggestion for code imporovement please let me know.