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

你这样不是log(n)的.

Posted by daringQQ at 2006-12-27 22:57:10 on Problem 2828
In Reply To:Re:好象求rank时复杂度高了些啊 Posted by:richardxx at 2006-12-27 22:53:08 
> 但是这和线段树的原理是一样的啊，我只是想编程简化点，不知道有没有办法在此基础上优化呢？
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