摘要: 最短路(堆优化) #include <bits/stdc++.h> using namespace std; const int inf = 1000000000; void dij() { int n, m, s; cin >> n >> m >> s; vector<vector<pair<in 阅读全文
posted @ 2021-01-31 23:51 19992147 阅读(64) 评论(0) 推荐(0) 编辑