![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
文章平均质量分 71
wxz1120171495
这个作者很懒,什么都没留下…
展开
-
UVA Ordering Tasks
#include <cstdio> #include <cstring> #include <iostream> #include <cmath> using namespace std; const int maxn = 100 + 5; int vis[maxn];//记录访问过程,是否访问过该节点 int g[maxn][maxn]; int ...原创 2018-02-26 23:48:35 · 128 阅读 · 0 评论 -
UVA Play on Words
#include <cstdio> #include <iostream> #include <string> #include <cstring> #include <cmath> using namespace std; const int maxn = 100; int vis[maxn]; int map[maxn][maxn],...原创 2018-03-01 18:39:10 · 384 阅读 · 1 评论 -
UVA Undraw the Trees
#include <cstdio> #include <iostream> #include <cstring> using namespace std; const int maxn = 200+ 5; char map[maxn][maxn];//存储读入的数据 int n; void dfs(int r,int c)//r表示行,c表示列 { print...原创 2018-03-03 15:50:49 · 119 阅读 · 0 评论 -
UVA Abbott's Revenge
#include <cstdio> #include <iostream> #include <cstring> #include <string> #include <queue> #include <vector> using namespace std; struct node { int r, c, dir;//横行...原创 2018-02-25 23:48:02 · 160 阅读 · 0 评论 -
HDU Tempter of the Bone
#include <cstdio> #include <iostream> #include <cstring> #include <algorithm> using namespace std; char map[10][10]; int visit[10][10]; int n, m, t; int sx, sy, ex, ey;//记录起点和终...原创 2018-04-08 16:03:50 · 111 阅读 · 0 评论 -
迷宫问题
#include <cstdio> #include <iostream> #include <cstring> #include <algorithm> #include <queue> using namespace std; int dir[4][2] = { {1,0},{-1,0},{0,1},{0,-1} }; int map...原创 2018-04-08 21:19:21 · 100 阅读 · 0 评论 -
poj stick
#include <cstdio> #include <algorithm> #include <cstring> #include <cmath> #include <iostream> using namespace std; int stick[205]; bool visit[205]; int n, m, sum; bool ...原创 2018-04-10 20:51:12 · 186 阅读 · 0 评论