LCA онлайн с подвешиванием деревьев

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
22:06:16
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

View all →

→ Find user

→ Recent actions

atcoder_official → AtCoder Beginner Contest 381 Announcement
physics0523 → How to blow up too weak hashing without thinking
MikeMirzayanov → Publish here your RayID if CloudFlare blocked you
4o2a → Optimality of today's E problem
snakefoot → How Can I Download All My Codeforces Submissions Without Manual Effort?
adamant → std::generator and recursive lambdas in C++23
ArshiaDadras → Rayan Contest 2024 — Selection (Div. 1 + Div. 2, Rated, Prizes!)
AkiLotus → On interactive problems
naivedyam → Why does my code give incorrect query format?
FeiWuLiuZiao → Is there a Manhattan Distance Minimum Spanning Path algorithm, or is it NPC
YouKn0wWho → CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
ACGN → Codeforces Round 987 (Div. 2) Editorial
luogu_official → 【LGR-208-Div.3】Luogu Round 208 Announcement
TheScrasse → Editorial of Codeforces Round 975 (Div. 1, Div. 2)
systemStart → A Bug of Tags
SecondThread → Hacker Cup Shirts 2024
hxu10 → My Meta hacker cup experience
TheGreatLoveImmortal → Where Do I find events going on at Codeforces?
Enigma27 → ICPC India Preliminary Online Round
atcoder_official → estie Programming Contest 2024 (AtCoder Regular Contest 188) Announcement
jackylova_fan_fan_fan → Online Mirror of The 6th FanRuan Cup Southeast University Programming Contest (Winter)
BledDest → 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest [Online Mirror, ICPC Rules]
Pyqe → Invitation to TLX Regular Open Contest #41
elsantodel90 → IOI 2025 Call for Tasks
Error_Yuan → Refact.ai Match 1 (Codeforces Round 985) Editorial

Detailed →

LCA онлайн с подвешиванием деревьев

Revision ru1, by RVS, 2016-01-02 00:04:49

Как онлайн отвечать на запрос LCA, а также подвешивать корень одного дерева за вершину другого?

lca, link-cut-tree

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	ru1		RVS	2016-01-02 00:04:49	131	Первая редакция (опубликовано)