Discussion @ 1052. Rabbit Hunt @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1052. Rabbit Hunt

I wonder the O(n*nlogn) algorithm to solve this problem , who could tell me ? Thx~

Posted by Yular 11 Aug 2011 18:47

Edited by author 11.08.2011 18:49