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

can you tell me about the o(n) algo in more detail? thx

Posted by xhope at 2003-11-01 20:34:54 on Problem 1456
In Reply To:Re:I get TLE~ isn Posted by:Grope at 2003-11-01 18:47:48

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

Followed by:

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