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:预处理是O(n),每条查询是O(1),对于最坏的情况,几乎每两个点都要算一次RMQ

Posted by cykt165883399 at 2007-07-09 16:19:11 on Problem 1741
In Reply To:预处理是O(n),每条查询是O(1),对于最坏的情况,几乎每两个点都要算一次RMQ Posted by:xiaomi at 2004-12-17 21:13:15
谁有rmq的标称,麻烦写一下

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