![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BFS+队列
Jerry Lee の blog
never never never give up.
展开
-
01矩阵中"1"的块数
输入6 70 1 1 1 0 0 10 0 1 0 0 0 00 0 0 0 1 0 00 0 0 1 1 1 01 1 1 0 1 0 01 1 1 1 0 0 0输出4#include <iostream>#include <cstdlib>#include <cstdio>#include <cmath>#include <string>#include <cstri原创 2017-11-16 14:27:19 · 1669 阅读 · 1 评论 -
起点 S到终点T的步数
起点 S到终点T的步数输入:5 5......*.*..*S*..***....T*2 2 4 3输出11#include <iostream>#include <cstdio>#include <cstdlib>#include <queue>#include <cstring>using namespace std;const int maxn=100;typedef原创 2017-11-16 16:08:02 · 531 阅读 · 0 评论