| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 172 |
| 2 | adamant | 164 |
| 3 | awoo | 163 |
| 4 | TheScrasse | 160 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 9 | orz | 145 |
| 9 | pajenegod | 145 |
need help in upsolve.
Hi all,
I am trying to upsolve this problem. https://codeforces.com/contest/1699/problem/E
Can someone please help me understand the first two paragraphs of the editorial ?
How to build the DP solution that is mentioned in the paragraph-2 ?
How to do it in O ( vmax * log vmax * log vmax ) ?
Thanks in advance.
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
papa-ka-para | 2024-01-05 12:50:20 | 371 | Initial revision (published) |
