8‘’搜索DFS&BFS
青年小陈陈
这个作者很懒,什么都没留下…
展开
-
HDU 2553 八皇后问题(DFS+回溯)
!注意点:此题测试量多,若不打表会超时。甚至可以直接在后台把答案跑好了直接存到一个数组里,到时候直接查表,也是可以的#include #include #include #include #include #include #include #include using namespace std;int a[1000]={0};//保存数列的数组,默认每个位置都是原创 2018-01-08 15:32:59 · 509 阅读 · 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 · 367 阅读 · 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 · 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 · 102 阅读 · 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 · 116 阅读 · 0 评论 -
1053. Path of Equal Weight (30)
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;int N,M,S;int weight[200]={0};struct node{ vector原创 2018-03-08 18:14:05 · 94 阅读 · 0 评论 -
1004. Counting Leaves (30)--dfs
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;int N,M;struct node{ vector child;}cube[200];in原创 2018-03-08 16:55:45 · 151 阅读 · 0 评论 -
1079. Total Sales of Supply Chain (25)--dfs
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;int N;double p,r;struct node{ vector child;};no原创 2018-03-08 16:29:44 · 113 阅读 · 0 评论 -
1091. Acute Stroke (30)--BFS数多少块儿
#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <cmath>#include <string>#include <cstring>#include <vector&a原创 2018-03-08 13:43:15 · 100 阅读 · 0 评论 -
1103. Integer Factorization (30)--dfs
#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <cmath>#include <string>#include <cstring>#include <vector&a原创 2018-03-07 20:21:28 · 113 阅读 · 0 评论 -
输出1~n的全排列(递归法)
#include #include #include #include using namespace std;int a[1000]={0};//保存数列的数组,默认每个位置都是0int book[1000]={0};//记录一个数有没有在数组里int n;//1~nvoid A(int pos)//向a[pos]填数{ if(pos==n+1)//递归边界原创 2018-01-08 14:28:53 · 11317 阅读 · 1 评论 -
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 · 156 阅读 · 0 评论