Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include<iostream>#include<queue>#include<cmath>using namespace std;typedef struct node {int l;int r;node(int a, int b) { l = a, r = b; }node() {}}node;int M, S;int H, W;char mtr[500][500];int biao[500][500];const int moven[8][2] = { {-1,0 },{-1,1},{0, 1} ,{1,1}, {1, 0},{1,-1}, {0, -1},{-1,-1} };node bfs(node sr,int& minl,int &minr,int& maxl,int &maxr)//规则为0可以走{queue<node>qb;qb.push(sr);biao[sr.l][sr.r] = 1;node de;while (!qb.empty()){node ned=qb.front();qb.pop();//biao[ned.l][ned.r] = 1;minl = min(minl, ned.l);