广搜+优先队列

点击打开链接

 
# include
# include
# include
using namespace std;
char map[305][305],flag[305][305];
struct steps
{
    int i;
    int j;
    int step;
};
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
bool operator <(steps a, steps b)
{
    return  a.step>b.step;
}
int main()
{
    int n,m,i,j,x,y,a,b,k;
    while(scanf("%d%d",&n,&m)&&n&&m)
    {
        steps p;
        getchar();
        priority_queues;
        k=0;
        memset(flag,0,sizeof(flag));
        for(i=0;i=0&&v.i=0&&v.j