This problem (How many cats you need to throw out of a building in order to determine the maximal floor where such a cat will survive. Quite cruel, actually), has an accepted answer with O(n^3) complexity. The problem is equivalent to this (How many cats you need to throw o
阅读背景：
解释这个O(n log n)算法对于扔猫蛋的问题
来源：互联网
分享到：
