If you have segment tree problems in rating range 1800-2000, please share in this blog post, I seen few posts of CF but in that there are very few problems of these difficulty range.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
If you have segment tree problems in rating range 1800-2000, please share in this blog post, I seen few posts of CF but in that there are very few problems of these difficulty range.
| Name |
|---|



1784C - Monsters (hard version)
okay
597C - Subsequences
okay
Xenia and Bit Operations
okay
1549D - Integers Have Friends can be solved using a segment tree or a sparse table
okay
1779D - Boris and His Amazing Haircut
okay
242E - XOR on Segment
(2000 rating) That is one of my favorites :)
okay
Tree or Not Tree
2900 rating :))
Ant colony
Amazing Thanks
Hi ,
Check Out SEGMENT EDU of codeforces for starting segment i think they are a >=1300 and <=2500 — [here] & [here]
And this is a few problem:
[1700 — Xenia and Bit Operations]
[1900 — Subsequences ]
[1900 — Enemy is weak]
And this is a few problem WITH over 2000 but not too hard:
[2100 — Water Tree ]
[2200 — Valera and Queries ]
[2200 — Yaroslav and Divisors ]
[2200 — Monsters (hard version) ]
[2200 — A Simple Task ]
and this problems are good for segment: __
Thanks
https://mirror.codeforces.com/problemset/problem/1430/E
https://mirror.codeforces.com/contest/1478/problem/E 1900
Can Someone suggest Problems and playlist for lazy segment tree propagation
https://mirror.codeforces.com/problemset/problem/1311/F
https://mirror.codeforces.com/contest/1881/problem/G
https://atcoder.jp/contests/abc339/tasks/abc339_e