lanqiao 1460 路径(floyd)
This commit is contained in:
@@ -14,9 +14,7 @@ void floyd(){
|
|||||||
for(int i = 1; i <= n; i++){
|
for(int i = 1; i <= n; i++){
|
||||||
for(int j = 1; j <= n; j++){
|
for(int j = 1; j <= n; j++){
|
||||||
if(mindis[i][k] != INF && mindis[k][j] != INF){
|
if(mindis[i][k] != INF && mindis[k][j] != INF){
|
||||||
if(mindis[i][k] + mindis[k][j] < mindis[i][j]){
|
mindis[i][j] = min(mindis[i][j], mindis[i][k] + mindis[k][j]);
|
||||||
mindis[i][j] = mindis[i][k] + mindis[k][j];
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -32,4 +30,5 @@ int main(){
|
|||||||
floyd();
|
floyd();
|
||||||
cout << mindis[1][n] << endl;
|
cout << mindis[1][n] << endl;
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
// correct output 10266837
|
||||||
Reference in New Issue
Block a user