Hello everyone, How do I do this question on CSES involving point updates using merge sort tree ONLY? https://cses.fi/problemset/task/1144
Hello everyone, How do I do this question on CSES involving point updates using merge sort tree ONLY? https://cses.fi/problemset/task/1144
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
If you are using c++, then you can use gnu pbds. It makes things really easy.
Yeah I just read a blog related to that, it is really great. But can we do without it?
I don't know, but if the constraints are less like x, p <= 10^6 then we can use BIT. May be we can apply here using some compression technique.
there's an Editorial for CSES Range Queries section . you can also refer to my comment if you want to solve it using bit .