UVa439——骑士的移动

简单bfs

 #include <iostream>
 #include <cstring>
 #include <string>
 #include <map>
 #include <set>
 #include <algorithm>
 #include <fstream>
 #include <cstdio>
 #include <cmath>
 #include <stack>
 #include <queue>
 using namespace std;
 const double Pi=3.14159265358979323846;
 typedef long long ll;
 const int MAXN=+;
 int dx[]={-,-,-,-,,,,};
 int dy[]={-,,-,,-,,-,};
 const int INF = 0x3f3f3f3f;
 const int NINF = 0xc0c0c0c0;
 const ll mod=1e9+;
 int M[][];
 struct node{
     int x;int y;int step;
     node (int x=,int y=,int step=)
     {
         this->x=x;
         this->y=y;
         this->step=step;
     }
 }now,tim;

 int bfs(int x1,int y1,int x2,int y2,string str1,string str2)
 {

     tim.x=x1;tim.y=y1;tim.step=;
     queue <node> Q;
     Q.push(tim);
     //cout <<x2<<" "<<y2<<endl;
     while(!Q.empty())
     {

         tim=Q.front();Q.pop();
         if(tim.x==x2&&tim.y==y2)
         {
             cout <<"To get from "<<str1<<" to "<<str2<<" takes "<<M[tim.x][tim.y]<<" knight moves.\n";
             return ;
         }
         for(int i=;i<;i++)
         {
             now.x=tim.x+dx[i];
             now.y=tim.y+dy[i];
             if(now.x>=&&now.y<=&&now.x<=&&now.y>=&&M[now.x][now.y]==-)
             {
                 now.step=tim.step+;
                 M[now.x][now.y]=M[tim.x][tim.y]+;
                 Q.push(now);
             }
         }
     }
     return -;
 }

 int main()
 {
     string str1,str2;
     while(cin>>str1)
     {
         cin>>str2;
         int x1,x2,y1,y2;
         memset(M,-,sizeof(M));
         x1=-str1[]+'';
         y1=str1[]-'a'+;
         y2=str2[]-'a'+;
         x2=-str2[]+'';
         M[x1][y1]=;
         //cout <<x1<<y1<<x2<<y2<<endl;
         bfs(x1,y1,x2,y2,str1,str2);
     }
     return ;
 }