优化--堆优化
codancer
为信仰而战斗
展开
-
EZDIJKST - Easy Dijkstra Problem(基础有向图最短路)
EZDIJKST - Easy Dijkstra Problemno tags Determine the shortest path between the specified vertices in the graph given in the input data.Hint: You can use Dijkstra's algorithm.Hint 2: if you're a lazy ...原创 2018-04-18 21:01:29 · 243 阅读 · 0 评论 -
【codeforces 20C】 Dijkstra?(堆优化)最短路
D - Dijkstra? CodeForces - 20C #include<bits/stdc++.h>using namespace std;typedef long long LL; const int MAXN = 1e5 + 10; const LL INF = 1LL<<62; vector<int> e[MAXN];//点 ...原创 2018-04-13 17:53:10 · 442 阅读 · 1 评论