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

这个不会的

Posted by frkstyc at 2007-03-06 18:00:52 on Problem 3145
In Reply To:有啊....同超时..............难道SET的UPPER_BOUND是O(N)的?? Posted by:ziliang at 2007-03-06 17:25:51
> 刚才测试了一下,貌似UPPER_BOUND是从小到大枚举测试的....
> 
> 我把1至20000放进set<int>里
> 
> 然后在里面循环14000000次找1,700MS
> 循环14000000找20000,居然要10几秒...... >_<

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