silenttkillerr's blog

By silenttkillerr, history, 9 months ago, In English

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.

  • Vote: I like it
  • +8
  • Vote: I do not like it

»
9 months ago, # |
  Vote: I like it -7 Vote: I do not like it
»
9 months ago, # |
  Vote: I like it +8 Vote: I do not like it
»
9 months ago, # |
  Vote: I like it +4 Vote: I do not like it
»
9 months ago, # |
  Vote: I like it +3 Vote: I do not like it

1549D - Integers Have Friends can be solved using a segment tree or a sparse table

»
9 months ago, # |
  Vote: I like it +3 Vote: I do not like it
»
9 months ago, # |
Rev. 3   Vote: I like it +3 Vote: I do not like it

242E - XOR on Segment

(2000 rating) That is one of my favorites :)

»
8 months ago, # |
  Vote: I like it +4 Vote: I do not like it
»
8 months ago, # |
Rev. 2   Vote: I like it +4 Vote: I do not like it

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: __

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

https://mirror.codeforces.com/contest/1878/problem/E Can be solved by binary search on segment tree

»
7 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Can Someone suggest Problems and playlist for lazy segment tree propagation