Description

int maze[5][5] = {

	0, 1, 0, 0, 0,

	0, 1, 0, 1, 0,

	0, 0, 0, 0, 0,

	0, 1, 1, 1, 0,

	0, 0, 0, 1, 0,

};

Input

Output

Sample Input

0 1 0 0 0
0 1 0 1 0
0 0 0 0 0
0 1 1 1 0
0 0 0 1 0

Sample Output

(0, 0)
(1, 0)
(2, 0)
(2, 1)
(2, 2)
(2, 3)
(2, 4)
(3, 4)
(4, 4)

思路：DFS题。找到每一条路取最短路径

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#define INF 0x3fffffff
using namespace std;

int mp[5][5];

int ans;
struct node {
	int x;
	int y;
}lu[30], pa[30];

bool vis[8][8];

const int dir[4][2] = {-1, 0, 1, 0, 0, 1, 0, -1};

void dfs(int x, int y, int deep) {
	if(x == 4 && y == 4 && deep < ans) {
		ans = deep;
		for(int i = 0; i < deep; i ++) {
			pa[i].x = lu[i].x;
			pa[i].y = lu[i].y;
		}
	}
	for(int i = 0; i < 4; i ++) {
		int tx = x + dir[i][0];
		int ty = y + dir[i][1];
		if(tx < 0 || tx > 4 || ty < 0 || ty > 4) continue;
		if(mp[tx][ty] == 0 && !vis[tx][ty]) {
			vis[tx][ty] = true;
			lu[deep].x = tx;
			lu[deep].y = ty;
			dfs(tx, ty, deep + 1);
			vis[tx][ty] = false;
		}
	}
}

int main() {
	for(int i = 0; i < 5; i ++) {
		for(int j = 0; j < 5; j ++) {
			scanf("%d", &mp[i][j]);
		}
	}
	memset(lu, 0, sizeof(lu));
	memset(pa, 0, sizeof(pa));
	memset(vis, false, sizeof(vis));
	ans = INF;
	lu[0].x = lu[0].y = 0;
	vis[0][0] = true;
	dfs(0, 0, 1);
	for(int i = 0; i < ans; i ++) {
		printf("(%d, %d)\n", pa[i].x, pa[i].y);
	}
	return 0;
}