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

确实,在前面再O(n)的扫一遍就可以了

Posted by mmd at 2007-10-06 22:28:14 on Problem 3419
In Reply To:同学说pivot可以O(1)算,那样的话这题总复杂度O(n)也是可以的了 Posted by:MrRight at 2007-10-06 21:39:22


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