DecayingSylow's blog

BinarySearchForces
By DecayingSylow, history, 13 months ago, In English
  • Vote: I like it
  • +6
  • Vote: I do not like it

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

I don't know if this is complaining but binary search is an important technique in cp and might be seen in many problems. Also A1A2B don't need a complicated binary search, only finding a lower bound in an array so you can't consider the problem binary search

→ Reply
  • »
    »
    13 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Still Binary Search ¯\_(ツ)_/¯

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

      Well yeah, but it's so simple use of it. It's even doable with sets

      → Reply
  • »
    »
    13 months ago, # ^ |
      Vote: I like it +7 Vote: I do not like it

    No, I'm not complaining (the contest was really good!), it's just a fun fact.

    → Reply
»
13 months ago, # |
  Vote: I like it +4 Vote: I do not like it

After SpeedForces, MathForces,... now we have BinarySearchForces

→ Reply