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

用求最短路的O(n^3)的算法改改就可以了。

Posted by gzw_02 at 2008-11-23 12:32:28 on Problem 2253 
  for k=1:n
    for i=1:n
      for j=1:n

   if( p[i][j] > max(p[i][k],p[k][j]) ) 
      p[i][j] = max(p[i][k],p[k][j])
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