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

这题好象有问题吧!

Posted by tianhan at 2009-06-04 10:21:33 on Problem 1125 and last updated at 2009-06-04 10:24:28
如果按照FLOYD算法求出每对顶点的最短路以后,再按照枚举每个顶点为起点,取出最大值后,再在这些最大值中最小值的话,那么以下这个数据我怎么也不能理解!
3
2 2 1 3 3
1 3 4
0
我用一个AC的代码跑了一下!结果是
1 3
可是 这个结果表明就没有经过2这个顶点啊!不是所有的顶点必须都经过吗?!请大牛门解释一下!谢谢!

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