摘要： #include <stdio.h>#include <stdlib.h>#include <string.h>#define MAXN 100int maze[MAXN][MAXN];int vis[MAXN][MAXN];int queue[MAXN*MAXN]; //队列int fa[MAXN][MAXN]; // 父结点int dx[]={0,0,-1,1};int dy[]={-1,1,0,0};int n,m; //n为行 m为列void bfs(int x, int y){ int front, rear, u, d; front = rear 阅读全文