摘要: Dijkstra 单源最短路堆优化 #include<bits/stdc++.h> using namespace std; typedef pair<int, int> PII; const int N = 2e5 + 10; int head[N], to[N], value[N], nex[N 阅读全文
posted @ 2020-03-20 17:08 lifehappy 阅读(315) 评论(2) 推荐(0)