 |
| ||||
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:是求从第一点到所有其他点的最短路径,我用floyd过了In Reply To:是求从第一点到所有其他点的最短路径,我用floyd过了 Posted by:windbells at 2004-10-05 19:22:16 用Dijkstra算法算dis[i](1<=i<=n) 然后居然是取max(dis[i]).... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
