Hi guys Can someone please give me a good resource of how to solve dynamic graph connectivity and dynamic lca using treaps or how to implement link cut trees using treaps .. i can not find any good resources for that. thanks in advance guys.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 01.06.2024 22:28:39 (k1).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by AzorAhai (previous revision, new revision, compare).
I just googled 'link cut tree' and the 3-rd link was a full paper by authors XD.
Well, from my expirience, start from link cut, cause full dina-conn has MUCH more complicated concept/implementation.
Btw u can just ask this guy Darooha directly, its Daniel Sleator, the one who invented Splay-trees and had done a lot of work in link-cut trees.
(Hint: u can use treaps instead of splay and get O(log^2) instead of O(Log) per query, but Darooha's papers use Splay)
P.S. Englando is dead