POJ - 3278（or HDU 2717）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.

题目给定n, k ，牛和农场主在同一坐标轴，n 和 k分别是农场主和牛的坐标，农场主想要抓住逃跑的奶牛，奶牛没有发现农场主的行动，没动。农场主一共有几种行动的方式，向前走一步，向后走一步，到达是当前坐标两倍的位置，耗时相同，都是1分钟，询问农场主想要抓到牛要花的最短的时间。

因为农场主向后走只有一种方式，所以当n > k的时候，花费时间只能是n - k。
当n < k的时候，可以成一个搜索的过程，很明显是一个三叉树，每一种行动方式都是一个分叉，利用bfs直到达到 k 时结束。这个题目当然用dfs也可以做，但是由于数据量的问题，会超时。

AC代码：

#include <cstdio>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 1e5 + 5;
int vis[maxn];
int n, k;
struct node
{
    int x;
    int step;
}q[maxn];

int bfs()
{
    int i, head, tail;
    node now, next;
    head = tail = 0;
    q[tail].x = n;
    q[tail].step = 0;
    tail++;
    vis[n] = 1;
    while(head < tail)
    {
        now = q[head];
        head++;
        for(i = 0; i < 3; i ++)   //遍历每一种行动的方式
        {
            if(i == 0)
                next.x = now.x - 1;
            else if(i == 1)
                next.x = now.x + 1;
            else
                next.x = 2 * now.x;
            if(next.x < 0 || next.x >= maxn)
                continue;
            if(!vis[next.x])
            {
                vis[next.x] = 1;
                next.step = now.step + 1;
                q[tail].x = next.x;
                q[tail].step = next.step;
                tail ++;
                if(next.x == k)
                    return next.step;
            }
        }
    }
}
int main()
{
    while(~scanf("%d%d", &n, &k))
    {
        memset(vis, 0, sizeof(vis));
        if(n >= k)
            printf("%d\n", n - k);
        else
            printf("%d\n", bfs());
    }
    return 0;
}