Xellos's blog

Codeforces Round #231 (Div2): Solution of problem E
By Xellos, 11 years ago, In English

This is a repost of the blog post from before Black Day. I'm lazy, though, so it's just printscreened from Google Cache :D. It got less sharp, but no less readable. Now in an improved version! (still a picture :D)

I really liked this problem (394E - Lightbulb for Minister), because it involves taking derivatives. You don't see this much in programming contests :D. Therefore, I'd like to post my solution in detail. This algorithm works clearly in O(N + M). My AC code: 5931254

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

»
11 years ago, # |
← Rev. 2   Vote: I like it +16 Vote: I do not like it

..

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I really don't see the point of the same chunk of text being written twice consecutively...

    → Reply