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 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
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/1878/problem/E Can be solved by binary search on segment tree
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