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:本来就不可能，答案规模完全可以是O(n+m)

Posted by zyl072 at 2008-10-23 18:52:33
In Reply To:本来就不可能，答案规模完全可以是O(n+m) Posted by:wywcgs at 2008-10-23 18:41:31 
求交集的答案规模最大只可能达到 O(min{n,m}) ...而且此时当且仅当一个集合是另一个集合的子集`~
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