随笔分类 -  dijkstra

单源最短路径（dijkstra）新模板
摘要：#include<cstdio> #include<algorithm> #include<cstring> #include<queue> using namespace std; const int maxn = 2e5+5; struct mint { int nxt, v, w; }e[ma 阅读全文
posted @ 2021-07-20 15:52 Mint-hexagram 阅读(63) 评论(0) 推荐(0)