Time complexity of dsu on tree

Правка en2, от code_warrior, 2020-06-22 19:59:30

I have recently read tutorial on dsu on trees in codeforces (Arpa's Blog).See this blog.(Specifically,the one titled easy to code in O(nlogn))I couldn't understand how the time complexity of it is O(nlogn).Please ,someone explain me!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский code_warrior 2020-06-22 19:59:30 54
en1 Английский code_warrior 2020-06-22 19:58:05 252 Initial revision (published)