Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

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

Posted by 476367795 at 2009-03-09 21:23:55 on Problem 2253
In Reply To:用求最短路的O(n^3)的算法改改就可以了。 Posted by:gzw_02 at 2008-11-23 12:32:28

>   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: