Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Doubt about Binary Search

Revision en1, by fofao_funk, 2016-03-16 03:00:19

Hi.

I was looking some solutions of problem 551C - GukiZ hates Boxes and I found this one: 11548616.

Basically, the code binary search the optimal time. One thing I can't understand is its stop condition (and then the choice of the optimal answer). The while stop condition in the main function is ma - mi > 1, i.e., it will stop when mi = ma + 1 and (I think) there will never be such case such that mi = ma. After that while, he prints the value of ma (right 'pointer' of binary search).

My doubt is: why can't mi be the optimal answer? How is he sure that ma is already the optimal answer despite mi being inside the 'search' range?

Any help is appreciated. Thanks!

Tags binary search, doubt

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English fofao_funk 2016-03-16 03:45:19 8 Tiny change: ' when `mi = ma + 1` and (I t' -> ' when `mi + 1 = ma` and (I t'
en3 English fofao_funk 2016-03-16 03:05:20 25 Tiny change: 'r despite `mi` being inside th' -> 'r despite the fact that `mi` is still inside th'
en2 English fofao_funk 2016-03-16 03:01:19 5 Tiny change: 'such case such that `mi ' -> 'such case that `mi '
en1 English fofao_funk 2016-03-16 03:00:19 726 Initial revision (published)