 |
| ||||
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 | |||||||||
>.<其实以前知道的，忘了In Reply To:找到原因了，不知道为什么 Posted by:cuiaoxiang at 2008-07-25 02:39:55 Complexity: logarithmic for random access iterators, linear otherwise (at most, log(numberOfElements) + 1 comparisons, but for other than random access iterators the number of operations to step through the elements is linear, making the total complexity linear). 一定要random access Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
