
最短路
超越大哥哥
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj2253(dijistra变形+堆优化)
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sun...原创 2019-05-05 16:11:15 · 198 阅读 · 0 评论 -
traffic jam(Dijkstra)
没啥好说的... // // Created by xingchaoyue on 2019/5/16. // #include<iostream> #include<cstdio> #include<queue> #include<string.h> using namespace std; int n,m; int mp[1005][100...原创 2019-05-17 12:55:39 · 369 阅读 · 0 评论 -
poj1797最短路变形
#include<iostream> #include<cstdio> #include<queue> #include<string.h> using namespace std; int t,n,m; const int maxn = 1e3+10; int mp[maxn][maxn]; const int inf = 0x3f3f3f3...原创 2019-08-03 14:15:10 · 176 阅读 · 0 评论 -
poj3660(floyd求传递闭包)
#include<iostream> #include<cstdio> using namespace std; int n,m; const int inf = 0x3f3f3f3f; int mp[200][200]; void init(){ for(int i = 0;i<=100;++i){ for(int j = 0;j<=...原创 2019-08-28 18:49:34 · 180 阅读 · 0 评论