In the new video, we’re going to talk about the amazing data structure called Segment Tree Beats, which allows us to support a huge number of operations that a regular segment tree can’t handle. We will learn how to take numbers on a segment modulo some number, apply the min= and max= operations, add += to them, and also find GCD on a segment with these operations. And all the proofs are gonna be super simple, so don’t be scared, it will be easy! In the next video, we will cover even more awesome queries, so stay tuned.
You can check out my previous videos on my channel
Contest on Segment Tree Beats (and others) is here
Also, there's the Russian version of this video if you speak Russian here
Implementations of algorithms from this video:
Everything from the previous implementation but also GCD on a segment of algorithms from this video: