CH2907 乳草的入侵 BFS

题目链接

http://noi-test.zzstep.com/contest/0x29%E3%80%8C%E6%90%9C%E7%B4%A2%E3%80%8D%E7%BB%83%E4%B9%A0/2907%20%E4%B9%B3%E8%8D%89%E7%9A%84%E5%85%A5%E4%BE%B5

分析

BFS裸题，每次向周边八个位置扩展即可。

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

inline int read() {
   
	int num = 0;
	char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9')
		num = num * 10 + c - '0', c = getchar();
	return num;
}

const int maxn =