Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:i think it is impossible, you need to sort it first.

Posted by Grope at 2003-11-01 21:15:06 on Problem 1456
In Reply To:i think it is impossible, you need to sort it first. Posted by:dynamic at 2003-11-01 20:57:42
Yes.The O(nlogn) is the best case.
The O(n) algorithm is based on the initialization (sorting) having already done.

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


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