I was wondering if there is a possible solution that uses a segment tree rather than a BBST (balanced binary search tree), as I find that segment trees are easier to implement.
Please help, and thanks in advance!
EDIT: Triple Bump!
→ Обратите внимание
До соревнования
Codeforces Round 940 (Div. 2) and CodeCraft-23
43:48:19
Зарегистрироваться »
Codeforces Round 940 (Div. 2) and CodeCraft-23
43:48:19
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 19.04.2024 21:46:42 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by vamaddur (previous revision, new revision, compare).
Auto comment: topic has been updated by vamaddur (previous revision, new revision, compare).
Auto comment: topic has been updated by vamaddur (previous revision, new revision, compare).
Auto comment: topic has been updated by vamaddur (previous revision, new revision, compare).
I don't think you can use range tree to solve it as u need to support deleting operations.
U can try Splay or SBBST or Skip list