Hello Codeforces!
I’ve recently decided to practice more Segment Tree problems. However, since Codeforces doesn't have a specific tag exactly for Segment Trees (they usually fall under "data structures"), it’s been a bit tough to filter for them specifically in the problemset.
Could you recommend some problems or specific problemsets that focus on Segment Trees? Considering my current rating, it would be perfect if the ratings were around 1500–1900. I'm looking for anything from standard to more "out of the box" implementations. If there are any classic "must-solve" problems in this range, please let me know!
Thanks to anyone who tries to help, and happy coding!
587C - Duff в армии
837G - Функции на отрезках
problem A
813E - Создание армии
Thanks!
try this
It's a Russian site, but translator exists for a reason.
Segment-tree problems are in "ДО-1", "ДО-2" sections(bottom of the page).
it seems i cannot have my solutions judged unless i signed up for their courses, right?
The problem is — u can not get your solution judged on this site, use it for the statements and ask gpt to generate tests
might as well ask them to solve the problem outright lol :))
https://codeforces.me/contest/2057/problem/D
Check this out-one of the best curated lists on the site.
https://youkn0wwho.academy/topic-list/segment_tree
Ant Colony [2100]
XOR on Segment [2000]
Enemy is Weak [1900]
Petya and Array [1800]
Sereja and Brackets [2000]
Distinct Characters Queries [1600]
BTW some of them might have co-ordinate compression hidden(or more like problem cant be solved without it) so do learn that as well since it extends to more applications.This does include Lazy propogation as well (mostly for higher rated problems)
tysm!
Some of these problems have a rating of >1900, but in my opinion their actual rating is lower, since the rounds from which these problems are taken were held quite a long time ago.
Segment Tree Problems