BFS
ZMST
这个作者很懒,什么都没留下…
展开
-
PAT——A1079 Total Sales of Supply Chain(树BFS)
题目链接:#include<cstdio>#include<cstring>#include<vector>#include<algorithm>#include<math.h>#include<cmath>using namespace std;#define maxn 100010struct nod...原创 2018-08-30 20:27:05 · 155 阅读 · 0 评论 -
PAT——A1020 Tree Traversals(树)
题目链接:#include<cstdio>#include<algorithm>#include<cmath>#include<cstring>#include<queue>using namespace std;#define maxn 50struct node{ int data; node* l...原创 2018-08-28 19:59:01 · 127 阅读 · 0 评论 -
PAT——A1090 Highest Price in Supply Chain(树的遍历)
题目链接:#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<vector>using namespace std;#define maxn 100010vector&l...原创 2018-08-30 10:30:37 · 107 阅读 · 0 评论 -
天梯赛——小字辈(树的遍历 BFS vector)
题目链接:#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#include<map>#include<set>u原创 2018-08-30 13:19:37 · 423 阅读 · 0 评论 -
UVa 122 - Trees on the level(BFS层序遍历 &&strchr&&sscanf)
题目链接: 原型: char *strchr(const char *s,char c);#include<string.h>查找字符串s中首次出现字符c的位置,返回首次出现c的位置的指针(可以当作数组),如果s中不存在c则返回NULL。 1.sscanf的用法: s={"(11,LL)"}; int v; 则:sscanf(&s[1],"%d"...原创 2018-10-15 19:12:14 · 182 阅读 · 0 评论 -
POJ3984 迷宫问题【BFS】
题目链接:#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<queue>#include<stack>#include<vector&g原创 2019-02-25 15:52:53 · 168 阅读 · 0 评论 -
Yuchang and Zixiang ‘s maze(BFS)
题目链接:#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<vector>#include<queue>#include<stack>using namespace std;#defin原创 2019-02-23 17:17:51 · 167 阅读 · 0 评论