 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
floyd求所有路径中最大值中的最小值==求最短路径中的最大值if(map[i][j]>max(map[i][k],map[k][j]))map[i][j]=max(map[i][k],map[k][j]);if(map[i][j]>max(map[i][k],map[k][j]))
map[i][j]=max(map[i][k],map[k][j]);
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
