someone can help me to solve this problem?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Название |
---|
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.