 |
| ||||
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:征集算法。。In Reply To:Re:征集算法。。 Posted by:wywcgs at 2007-05-16 15:44:54 > 第一个求割点同时就能求出分支数了，复杂度O(V+E)的 具体是怎么求？？有点没明白， 我想的是求桥，然后去找与桥连接最多的点，然后再dfs一次求出个数。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
