Segment Tree of DSUs
Difference between en2 and en3, changed 2 character(s)
Hello all, ↵

Are there any good (yet basic) problems that use a segment tree of dsus? I've been reading a lot of problem tutorials that use this as the solution, but I don't really understand how it works. I was hoping to start out with simpler problems and gradually work to the harder problems.↵

However, when I tried searching the topic up on google, the closest thing I could find was an article that briefly mentioned combining segment trees and dsus but failed to explain it for a beginner. ↵

The example problem is here: https://codeforces.com/contest/763/problem/
DE

Any recommendations would be greatly appreciated!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English wet_water 2019-09-12 19:35:18 2 Tiny change: '3/problem/D\n\nAny re' -> '3/problem/E\n\nAny re'
en2 English wet_water 2019-09-12 17:11:38 77
en1 English wet_water 2019-09-12 09:44:01 574 Initial revision (published)