Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:貌似是求最小生成树中从源点到终点这条唯一路径中边长最大的,那么怎么求从源点到终点这条唯一路径中边长最大的?

Posted by a58377215 at 2010-02-08 13:56:30 on Problem 2253
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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator