| ||||||||||
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 |
我用的Kruskal,只要求一下次小生成树就行了In Reply To:Re:Kruskal是用并查集的,Prim是每次加一个离树最近的节点 Posted by:uni at 2005-05-10 15:01:15 > 这题你们的算法是什么? > 怎么才能判断是不是UNIQUE的 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator