};
int startx,starty,endx,endy;//记录起点跟终点
char mapp[maxn][maxn];//记录地图
bool vis[maxn][maxn];//纪录是否访问过了...int f[4][2] = {{0,1},{0,-1},{1,0},{-1,0}};//定义方向数组
int n,m;
int ans;
int BFS(int startx,int starty...qu.empty()) qu.pop();
node st = {startx,starty,0};
qu.push(st);//把第一个起始点加入
vis[startx][starty]...i<=n;i++){
for(int j=1;j<=m;j++){
cin>>mapp[i][j];
if(mapp[i][j]=='S'){
startx...starty = j;
}
if(mapp[i][j]=='E'){
endx = i;
endy = j;
}
}
}
ans = BFS(startx