![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BFS
文章平均质量分 79
Usher_Ou
这个作者很懒,什么都没留下…
展开
-
最少步数
最少步数时间限制:3000 ms | 内存限制:65535 KB难度:4描述这有一个迷宫,有0~8行和0~8列: 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1原创 2017-03-03 17:35:34 · 340 阅读 · 0 评论 -
坦克大战
坦克大战时间限制:1000 ms | 内存限制:65535 KB难度:3描述Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. What we are dis原创 2017-03-10 17:03:45 · 337 阅读 · 0 评论 -
DFS&&BFS模板
DFS模板#include<cstdio>#include<cstring>#include<cstdlib>using namespace std;const int maxn=100;bool vst[maxn][maxn]; // 访问标记int map[maxn][maxn]; // 坐标范围int dir[4][2]= {0,1,0,-1,1,0,-1,0}; // 方向向原创 2017-04-02 17:24:01 · 594 阅读 · 0 评论 -
POJ 3278 Catch that cow
Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 87429 Accepted: 27431 Description Farmer John has been informed of the location of a fugitive cow and原创 2017-04-03 16:35:39 · 324 阅读 · 0 评论 -
POJ 2251 Dungeon Master
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32421 Accepted: 12431DescriptionYou are trapped in a 3D dungeon and need to find the quick原创 2017-04-03 20:37:49 · 200 阅读 · 0 评论 -
POJ 3984 迷宫问题
迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20612 Accepted: 12062 Description 定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0原创 2017-04-04 10:04:16 · 367 阅读 · 0 评论 -
POJ 3087 Shuffle'm Up
Shuffle'm UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10637 Accepted: 4918DescriptionA common pastime for poker players at a poker table is to s原创 2017-04-04 20:20:35 · 205 阅读 · 0 评论