I'm learning binary lifting right now, already solved LCA and http://codeforces.me/problemset/problem/932/D.
Can you please suggest other problems that can be solved via binary lifting, I want to train this technique.
Thank you.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | nik_exists | 131 |
| 8 | Dominater069 | 131 |
| 10 | Proof_by_QED | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 03.09.2026 20:03:15 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
609E - Minimum spanning tree for each edge This is a good problem solvable with binary lifting.
thx
588E - Duff in the Army. Nice problem, maybe some complex implementation, but if You'll solve it, You'll definitely have no problems with Binary Rise
Thnx.. It is a really nice problem on the topic.
Old topic, but for those stumbling upon it through Google like me, here is another one: 1516D — Cut
Here is another one from codechef LGSEG
Another good one: Teleporter
1535E - Gold Transfer is a nice starter problem for binary lifting on trees.