DFS-深度优先算法解决迷宫问题

/*
main.cpp
*/
#define  _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;

int sr, sc, dr, dc;
int R,C,minLen = ;
char grid[][];
bool found[][];

void dfs(int r, int c, int len);

int main()
{
    freopen("./data.in", "r", stdin);
    cin >> R >> C;
    for (int i = ; i < R;i++)
    for (int j = ; j < C; j++)
    {
        cin >> grid[i][j];
        if (grid[i][j] == 'S'){ sr = i; sc = j; }
        if (grid[i][j] == 'D'){ dr = i; dc = j; }
        found[i][j] = false;
    }
    dfs(sr, sc, );
    cout << minLen << endl;
    return ;
}
int d[][] = { { -,  }, { ,  }, { , - }, { ,  } };

void dfs(int r, int c, int len)
{
    if (r == dr&&c == dc)
    {
        if (minLen > len)
            minLen = len;
        return;
    }
    for (int i = ; i < ; i++)
    {
        int nextR = r + d[i][];
        int nextC = c + d[i][];
        if (nextR <  || nextR >= R || nextC <  || nextC >= C) continue;
        if (grid[nextR][nextC] == 'X') continue;
        if (found[nextR][nextC] == true) continue;
        found[nextR][nextC] = true;
        dfs(nextR, nextC, len + );
        found[nextR][nextC] = false;
    }
}

6 6
S.XD..
..XXX.
...X..
......

data.in文件