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

额，LZ你误解了吧

Posted by Snow_storm at 2010-10-19 01:24:46 on Problem 3615 and last updated at 2010-10-19 01:25:09
In Reply To:floyd求所有路径中最大值中的最小值==求最短路径中的最大值if(map[i][j]>max(map[i][k],map[k][j]))map[i][j]=max(map[i][k],map[k][j]); Posted by:heike567 at 2010-03-05 14:59:15 
RT 看看样例吧
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