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!
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.09.2026 12:44:52 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
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