bfs问题
文章平均质量分 74
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 · 126 阅读 · 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 · 383 阅读 · 1 评论 -
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 评论 -
UVA Ideal Path
#include <cstdio>#include <iostream>#include <cstring>#include <cmath>#include <algorithm>#include <vector>#include <queue>using namespace std;const i原创 2018-03-05 23:20:02 · 143 阅读 · 0 评论 -
Dungeon Master
#include <cstdio>#include <iostream>#include <cmath>#include <queue>#include <cstring>using namespace std;char s[35][35][35];int vis[35][35][35];//标记相应的访问状态int d[...原创 2018-03-26 23:09:06 · 115 阅读 · 0 评论 -
UVA 非常可乐
#include <cstdio>#include <iostream>#include <cmath>#include <cstring>#include <queue>using namespace std;struct node{ int x[3];//记录倒水过程中倒水的状态,利用相应的中间状态进行记录 int ...原创 2018-03-27 20:33:51 · 124 阅读 · 0 评论