Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

Re:I get TLE~ isn

Posted by Grope at 2003-11-01 18:47:48 on Problem 1456
In Reply To:I get TLE~ isn't it o(n^2), i can't optimize it any more :( Posted by:xhope at 2003-11-01 17:03:47

There is an O(n) algorithm.
Using heap,you can get an O(nlogn) algorithm.

Followed by:

can you tell me about the o(n) algo in more detail? thx (81) xhope 2003-11-01 20:34:54
- i think it is impossible, you need to sort it first. (0) dynamic 2003-11-01 20:57:42
  - Re:i think it is impossible, you need to sort it first. (116) Grope 2003-11-01 21:15:06
    - Re:i think it is impossible, you need to sort it first. (52) Grope 2003-11-01 21:16:34

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator