Today due to a power outage there may be disruptions in the work of Codeforces and Polygon. Please do not plan any important events during this time. If there are details or the exact time, we will definitely publish them. Estimated time of maintenance: from 3 Aug, 14:30 (UTC) to 3 Aug, 18:00 (UTC). ×

AlgorithmsThread Ep 3: Segment Trees (+ hard ST Problem)
Difference between en4 and en5, changed 389 character(s)
AlgorithmsThread Episode 3: Segment Trees↵

Hi everyone, I just made [Episode 3 of AlgorithmsThread]( This one is a bit easier than usual and covers Segment Trees. At the end of the video, I talk about an interesting and difficult Segment Tree problem called Sneetches, that might be worth reviewing if you already know your segment trees quite well.↵

This video is a bit easier because the next two will be about some hard segment tree topics, and this should help prevent people who don't know segment trees yet from getting completely lost.↵

If you have any questions on stuff I covered, the comments below is a great place for them!

Update: Problem Links↵

- [Sneetches Problem Statement](↵

- [Sneetches Solutions + data](↵

- [Round 654 Problem F](, which uses a very similar idea, in case you want a good practice problem.


  Rev. Lang. By When Δ Comment
en6 English SecondThread 2020-07-29 16:33:13 4
en5 English SecondThread 2020-07-29 16:32:27 389
en4 English SecondThread 2020-07-17 23:46:01 15
en3 English SecondThread 2020-06-24 19:44:31 5
en2 English SecondThread 2020-06-24 19:38:35 0 (published)
en1 English SecondThread 2020-06-24 18:54:50 749 Initial revision (saved to drafts)