 |
| ||||
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:用prim就可以了！prim过程中记录父节点，求出来最小代价生成树，在两个frog间路径里面求出最大边即可！In Reply To:用prim就可以了！prim过程中记录父节点，求出来最小代价生成树，在两个frog间路径里面求出最大边即可！ Posted by:zhb_msqx at 2007-09-09 15:31:35 好强，都没与想到 我用dij记录最长的边来求的 慢死了 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
