至少努力过

Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adja

Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adja

题意：给定一个二维数组，从@出发，寻找到达E的最短路径，#表示墙壁，不能通行如：@----#         ---#-#         -----E#include #include using namespace std;const int maxn=30;char map[maxn][maxn];int vis[maxn][maxn]; //判重