蓝桥杯—迷宫

问题描述：

下图给出了一个迷宫的平面图，其中标记为1的为障碍，标记为0的为可以通行的地方。

010000

000100

001001

110000

迷宫的入口为左上角，出口为右下角，可以按DRRURRDDDR的顺序通过迷宫，一共10步，其中D、U、L、R表示向下，向上，向左，向右。对于下面这个更复杂的迷宫（30行50列），请找出一种通过迷宫的方式，其使用的步数最小，在步数最小的前提下，找出字典序最小的作为答案。请注意在字典序中D<L<R<U.

01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000

#include<iostream>
#include<stack>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
const int maxn=50;
bool vis[maxn][maxn];
int n,m;
char a[maxn][maxn];
int dir[4][2]={{1,0},{0,-1},{0,1},{-1,0}};
char d[4]={'D','L','R','U'};
struct node
{
    int x,y,step;
    string str;
};
void bfs()
{
    queue<node>que;
    node p,next;
    p.x=0,p.y=0,p.step=0,p.str="";
    que.push(p);
    vis[p.x][p.y]=1;
    while(!que.empty())
    {
        p=que.front();
        que.pop();
        if(p.x==n-1&&p.y==m-1)
        {
            cout<<p.str<<endl;
            cout<<p.step<<endl;
            return;
        }
        for(int k=0;k<4;k++)
        {
            next.x=p.x+dir[k][0];
            next.y=p.y+dir[k][1];
            if(next.x>=0&&next.x<n&&next.y>=0&&next.y<m&&!vis[next.x][next.y]&&a[next.x][next.y]=='0')
            {
                next.step=p.step+1;
                next.str=p.str+d[k];
                vis[next.x][next.y]=1;
                que.push(next);
            }
        }
    }
}
int main()
{
    while(cin>>n>>m)
    {
        for(int i=0;i<n;i++)
            scanf("%s",a[i]);
        bfs();
    }
    return 0;
}