![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法基础课-3、搜索与图论
C++练习
JIngles123
生命不息,奋斗不止
展开
-
拓扑排序 - AcWing 848. 有向图的拓扑序列(C++)- 简单
题目链接:https://www.acwing.com/problem/content/description/850/ 题目如下: #include <iostream> #include <algorithm> #include <cstring>//memset #include <queue> using namespace std; const int N=100010; int n,m; vector<int> g[N];//存原创 2022-05-17 10:53:46 · 157 阅读 · 0 评论 -
BFS - AcWing 845. 八数码(C++)- 中等
题目链接:https://www.acwing.com/problem/content/description/847/ 题目如下: #include <iostream> #include <algorithm> #include <queue> #include <unordered_map> using namespace std; int bfs(string start){ string end="12345678x";原创 2022-05-14 00:19:05 · 151 阅读 · 0 评论 -
BFS - AcWing 844. 走迷宫(C++)- 简单
题目链接:https://www.acwing.com/problem/content/description/846/ 题目如下: #include <iostream> #include <queue> #include <vector> #include <cstring> using namespace std; const int N=1000; typedef pair<int,int> PII; int n,m; int a[N原创 2022-05-13 22:39:29 · 191 阅读 · 0 评论 -
DFS - AcWing 843. n-皇后问题(C++)- 中等
题目链接:https://www.acwing.com/problem/content/description/845/ 题目如下: #include <iostream> #include <vector> using namespace std; const int N=100010; int n; vector<vector<string>> result; void backtracking(int n,int startRow,vector<原创 2022-03-17 22:20:20 · 636 阅读 · 0 评论 -
DFS - AcWing 842. 排列数字(C++)- 简单
题目链接:https://www.acwing.com/problem/content/844/ 题目如下: #include <iostream> #include <vector> using namespace std; const int N=10; int n; int path[N]; void backtracking(int index,vector<bool>& used); int main(){ cin>>n;原创 2022-03-07 21:49:44 · 151 阅读 · 0 评论