someone can help me to solve this problem?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.12.2024 04:16:40 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
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.