 |
| ||||
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 | |||||||||
Re:据说这题有o(n^2)的解法，用次小生成树时间复杂度为o(n^3)In Reply To:据说这题有o(n^2)的解法，用次小生成树时间复杂度为o(n^3) Posted by:lbt at 2010-11-13 09:33:53 次小生成树就是O(N^2)吧 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
