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)rmq pk O(nlogn)rmq 在n<100w的时候几乎没有优势

Posted by sunmoonstar at 2006-12-09 21:32:18 on Problem 3080
In Reply To:那个O(n)的论文讲得貌似挺浅显易懂的…… Posted by:wywcgs at 2006-12-09 21:28:01


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