What's asymptotic of author's solution?
--
I have O(n*(logn)^2) solution that works fastly when N = 100000 but about 5sec when N = 500000.
Constant is big.

How to solve this problem?

• Problem 2886 (about candies). (29) grenkin 2006-07-30 18:01:15
  • should be O(nlgn) (33) frkstyc 2006-07-30 19:34:17
    • Re:should be O(nlgn) (44) grenkin 2006-07-31 09:23:31
      • http://acm.pku.edu.cn/JudgeOnline/showcontest?contest_id=1193 (48) mostleg 2006-07-31 09:54:29