![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路
最短路
日川钢板、
这个作者很懒,什么都没留下…
展开
-
洛谷 P1144 最短路计数
代码#include<cstdio>#include<iostream>#include<algorithm>#include<cstdlib>#include<cmath>#include<vector>#include<queue>#include<cstring>using namespace std;int n,m;int d[1000100];int vis[1000100];原创 2020-11-10 20:32:07 · 71 阅读 · 0 评论 -
HDU1217 Arbitrage
代码#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<vector>#include<cmath>#include<queue>#include<map>using namespace std;struct edge{int v;double w;};vector<edge>原创 2020-11-10 19:47:30 · 81 阅读 · 0 评论 -
hdu2112(HDU Today 简单最短路)
代码如下#include<cmath>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<map>using namespace std;map<string,int>mp;int cnt=0;string st原创 2020-11-09 21:51:26 · 80 阅读 · 0 评论 -
洛谷 P4779 【模板】单源最短路径(标准版)
先放代码:#include<cstdio>#include<cstring>#include<vector>#include<queue>#include<algorithm>#include<iostream>using namespace std;struct edge{int v;int w;};struct node{ int u; int d; bool operator <( const nod原创 2020-11-07 22:31:40 · 276 阅读 · 0 评论 -
洛谷 P3385 【模板】负环
在SPFA中,每个点最多被松弛n-1遍,所以一个点被松弛n遍后可以认为出现了负环。代码如下:#include<cstdio>#include<cstring>#include<vector>#include<queue>#include<algorithm>#include<iostream>using namespace std;struct edge{int v;int w;};vector<edge>原创 2020-11-07 19:06:16 · 136 阅读 · 1 评论