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:用二分16MS,复杂度为O(nlogN),可是用另外一种复杂度为O(n^2)的解法跑了0MS,不明白为什么!!

Posted by yangzefeng at 2012-12-16 18:52:35 on Problem 2533
In Reply To:用二分16MS,复杂度为O(nlog), Posted by:yangzefeng at 2012-12-16 18:51:22


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