| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Problem Link : Copying Books
I have arrived at the minimum of the maximum values.But I am not able to figure out how to partition the books.
My Solution : Ideone
Please guide me as to how to print the partitioning of the books.Do I need to know more to find out how to partition? or is this just enough to compute the partitioning.If this is enough,how do I compute it?
You can print it in reversed order, here is what I did: http://ideone.com/XDnQnT
Its giving me wa.The link int the question has the updated solution.I checked the limits, int should do fine but still giving me wa.
Is your binary search correct? The
hiis exclusive, so you should initializehiwithsum+1.