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.me/contest/763/problem/D

Any recommendations would be greatly appreciated!