[kuangbin带你飞]专题一 简单搜索 - K - 迷宫问题

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<queue>
 using namespace std;
 struct node
 {
     int x;
     int y;
     int s;
 };
 int g[][];
 int d[][]={{,},{-,},{,},{,-}};
 int main()
 {
 //    freopen("in.in","r",stdin);
     node s, t;
     string l;
     queue<node>q;
     vector<node>v;

     for(int i = ; i <= ; i++)
         for(int j = ; j <= ; j++)
             g[i][j] = ;    

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

     s.x = ;
     s.y = ;
     s.s = -;
     q.push(s);
     while(q.size())
     {
         s = q.front();
         q.pop();
         g[s.x][s.y] = s.s;
         if(s.x ==  && s.y == )    break;

         for(int i = ; i < ; i++)
         {
             t.x = s.x + d[i][];
             t.y = s.y + d[i][];
             t.s = s.s - ;
             if(g[t.x][t.y] == )
                 q.push(t);

         }
     }
     while(q.size())    q.pop();
     s.x = ;
     s.y = ;
     q.push(s);
     while(q.size())
     {
         s = q.front();
         q.pop();
         if(s.x ==  && s.y == )    break;
         for(int i = ; i < ; i++)
         {
             t.x = s.x + d[i][];
             t.y = s.y + d[i][];
             if(g[t.x][t.y] == g[s.x][s.y] + )
             {
                 q.push(t);
                 v.push_back(t);
                 break;
             }
         }
     }
     for(int i = v.size() - ; i >= ; i--)
         printf("(%d, %d)\n",v[i].x-,v[i].y-);
     printf("(4, 4)\n");
     return ;
 }