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(lg n)了吧?

Posted by kamel52045386 at 2008-07-23 16:20:25 on Problem 1007
In Reply To:算逆序数可以O(n)完成的 Posted by:nightelf at 2007-08-28 12:35:42
RT

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