POJ - 3278 Catch That Cow（BFS——广度优先搜索）

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

• Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
• Teleporting: FJ can move from any point X to the point 2 × X in a single minute.

If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?
Input
Line 1: Two space-separated integers: N and K
Output
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample Input
5 17
Sample Output
4

Hint
The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes.

AC代码

#include<cstdio>
#include<queue>
#include<iostream>
#include<cstring>
using namespace std; 
int vis[100005],step[100005];//vis数组是为了避免重复的搜索，step数组则是记录移动的次数。 
int bfs(int a,int b)
{
    queue<int>q;
    q.push(a);
    step[1]=0;
    vis[a]=1;
    if(a>b)
    return a-b;//这里是一个小坑,当农夫的位置比奶牛大的时候农夫只能通过自减到达奶牛的位置。 
    while(!q.empty())
    {
        int k=q.front();
        q.pop();
        if(k==b)
        return step[k];
        else
        {
            if(!vis[k-1]&&k-1>=0&&k-1<=100000)//第一种方法减一； 
            {
                q.push(k-1);
                vis[k-1]=1;
                step[k-1]=step[k]+1;
            }
            if(!vis[k+1]&&k+1<=100000&&k+1>=0)//第二种方法加一； 
            {
                q.push(k+1);
                vis[k+1]=1;
                step[k+1]=step[k]+1;
            }
            if(!vis[k*2]&&k*2<=100000&&k*2>=0)//第三种方法增倍； 
            {
                q.push(k*2);
                vis[k*2]=1;
                step[k*2]=step[k]+1;
            }
        }
    }
    return 0; 
}
int main(void)
{
    int n,k;//n是农夫的位置，k是奶牛的位置。 
    memset(vis,0,sizeof vis);//初始化 
    memset(step,0,sizeof step);//初始化 
    cin>>n>>k;//单组输入。 
    cout<<bfs(n,k)<<endl;
    return 0;
}