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:a58377215 at 2010-02-08 13:55:31 这样的?青蛙说了一定要走最短的路径的么? 如果是 3 4 和 1 1 1 1 1 1 1 那青蛙应该走哪条路的呢? Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator