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 lqp18_31 at 2009-08-06 19:58:35 on Problem 1609
In Reply To:提醒nlogn wa的同志们 Posted by:LiWang112358 at 2009-05-23 20:21:58 
           else{
                int l=0,r=len+1,mid;
                while( l+1<r ){
                       mid=(l+r)>>1;
                       if( b[ mid ]>a[ i ].b ) r=mid;
                       else l=mid;
                }
                b[ r ]=min( b[ r ] , a[ i ].b );
           }
就可以了
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