 |
| ||||
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 | |||||||||
inIn Reply To:找到环后是不是还要扫一遍环? 这样做是不是最坏情况下是O(N*Q)的? Posted by:sillybird at 2008-10-02 17:02:35 刚才稍微看了一下，貌似就像ustcacm那么说的方法即可。 每次只扫圈上的点，然后并掉，这样这个点以后就不会再被扫到了。所以平均每个点也就扫一次到两次左右，是均摊线性的。其它的东西，用并查集稍微优化一下就可以。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
