 |
| ||||
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 | |||||||||
既然在讨论一般情况，我想我们所说的O(m+n)应该就是worst case的复杂度In Reply To:Re:本来就不可能，答案规模完全可以是O(n+m) Posted by:zyl072 at 2008-10-23 18:52:33 > 求交集的答案规模最大只可能达到 O(min{n,m}) ...而且此时当且仅当一个集合是另一个集合的子集`~
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
