lanqiao 1460 路径(Dijkstra)
This commit is contained in:
@@ -9,7 +9,7 @@ int s = 1, n = 2021;
|
||||
|
||||
// 朴素版dijkstra-时间复杂度 O(n^2)
|
||||
void dijkstra(int s){
|
||||
mindis[s] = 0;
|
||||
mindis[s] = 0; // 自己到自己的距离为0
|
||||
for(int i = 1; i <= n; i++){
|
||||
int mi = INF, cur = 0;
|
||||
for(int j = 1; j <= n; j++){
|
||||
|
||||
Reference in New Issue
Block a user