someone can help me to solve this problem?
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
You for solve this problem should know algorithm ("segment tree") :))
You know?
segment tree isn't algorithm and i know this data structure
ooooo Yes this data structure
this problem is classic problem segment tree
if you know segment tree so you can solve this problem
Автокомментарий: текст был переведен пользователем Outsider (оригинальная версия, переведенная версия, сравнить).
I think it is Mo algorithm ( sqrt decomposition ). You can read about it ;)
You can solve this problem using segment tree in witch every node is a multiset. Then the build complexity will be O(Nlog(N)), because the tree is balanced. And each query and update will be done in O(log^2(N)).
Please, describe me how you will find sum for theravada second query ? I solve some problems with segment tree, but I never solve something like it.
About my solution, now I am not pretty sure( because we have update), but some sqrt decompostion should be good.