poj 3984 迷宫问题(dfs)

题目链接：http://poj.org/problem?id=3984

思路：经典型的DFS题目。搜索时注意剪枝：越界处理，不能访问处理。

代码：

#include <iostream>
using namespace std;

const int MAX_N = ;
int map[MAX_N][MAX_N];
typedef struct Node
{
    int x;
    int y;
}Road;
Road vis[MAX_N];

int SearchRoad( int i, int j, int count )
{
    if ( i ==  && j ==  )
    {
        vis[count].x = i;
        vis[count].y = j;
        for ( int i = ; i <= count; ++i )
            printf( "(%d, %d)\n", vis[i].x, vis[i].y );
    }
    else
    if ( i >=  || j >=  || map[i][j] ==  )
        return ;
    else
    {
        vis[count].x = i;
        vis[count].y = j;

        count++;
        SearchRoad( i+, j, count );
        SearchRoad( i, j+, count );
    }

    return ;
}

int main()
{
    for ( int i = ; i < ; ++i )
        for ( int j = ; j < ; ++j )
            scanf( "%d", &map[i][j] );

    SearchRoad( , ,  );
    return ;
}