![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
10‘’图
青年小陈陈
这个作者很懒,什么都没留下…
展开
-
1072. Gas Station (30)-dijk
#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <queue&a原创 2018-03-16 17:18:42 · 112 阅读 · 0 评论 -
1087. All Roads Lead to Rome (30)---最全dijk
#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <queue&a原创 2018-03-16 19:35:01 · 238 阅读 · 0 评论 -
1013. Battle Over Cities (25)---dfs
#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <queue&a原创 2018-03-10 21:35:28 · 122 阅读 · 0 评论 -
1021. Deepest Root (25)
#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <queue&a原创 2018-03-11 00:02:34 · 106 阅读 · 0 评论 -
1034. Head of a Gang (30)--dfs复杂版本、map的用法
1。<key,value>2。if (mp.find(string)==mp.end() )则说明map里面没有string这个key3。map中会自动按照key的递增排好序,可以当做一个大set用#include <cstdio>#include <cstdlib>#include <iostream>#include <algorit...原创 2018-03-12 17:39:02 · 124 阅读 · 0 评论 -
1076. Forwards on Weibo (30)--和层数有关的最好用bfs,用dfs容易不然出现短路或者环的情况
#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <queue&a原创 2018-03-12 19:12:13 · 370 阅读 · 0 评论 -
1018. Public Bike Management (30)---dijk+dfs
思路:先用dijk求出最短路,利用pre[v]保存成另一个图,再用dfs深搜这个新图#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <string>#include <cstring>#inclu...原创 2018-03-13 20:10:05 · 159 阅读 · 0 评论