 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
了解了,其实我觉得可以借鉴2114的标程的方法,nlogn的复杂度In Reply To:预处理是O(n)，每条查询是O(1)，对于最坏的情况，几乎每两个点都要算一次RMQ Posted by:xiaomi at 2004-12-17 21:13:15 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
