OJ Board

[quote="wook"]
it seems that o(n^2) algorithm with efficient cutting makes AC,
if the number of top sticks is small.
also waterloo's solution is o(n^2).
BUT there can be worst case,
by 1st~99999th stick, every sticks are top sticks,
and 100000th stick crosses all of them;
then answer is 1 < 1000 ...