I need problems about Queries on Tree.
which data structures need problems same as above?
Can you guys suggest problems?
Any help will be appreciated very much :)
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 20.04.2026 09:54:35 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
Heavy-Light Decomposition.
Wiki
E-maxx (Russian)
I didn't understand clearly. But if you are looking for tree query related problems, you can try QTREE , QTREE2 , QTREE3 , QTREE4 , QTREE5 , QTREE6
if you don't mind would you please give some hints on how to solve QTREE4? I'm quite sure it can be done with heavy-light decomposition but I couldn't get a solution! I need to keep track of the currently longest path and second longest path and the third and so on to be able to switch between them after white nodes get blackened.
Sorry, I am yet to solve this problem.
Aha no problems, thank you.
Heavy light decomposition (with Segment tree) problem for beginners : http://acm.timus.ru/problem.aspx?space=1&num=1553 If you need the code, you can see my code: https://sites.google.com/site/kc97ble/container/heavylight-cpp
thanks :)