#15-【广度优先搜索】炸僵尸

程序如下：

 

#include <iostream>
#include <queue>

#define SIZE 2001

using namespace std;

struct node
{
	int x, y;
};

char a[SIZE][SIZE];
bool v[SIZE][SIZE];
int res;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
node _next;
queue<node> q;

int _up(int x, int y) //