someone can help me to solve this problem?
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 164 |
| 3 | awoo | 163 |
| 4 | TheScrasse | 155 |
| 5 | nor | 153 |
| 6 | maroonrk | 152 |
| 6 | -is-this-fft- | 152 |
| 8 | Petr | 145 |
| 9 | pajenegod | 144 |
| 9 | orz | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 19.06.2024 22:36:21 (l1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.