13.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?

输入：

Line 1: Two space-separated integers: <i>N</i> and <i>K</i>

输出：

Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

样例：

5 17

4

题目描述： Famer Jhon 要抓一个位置固定的奶牛，他共有三种移动方式 n+1，n-1，2*n。

思路：

1.用队列保存每个搜索的元素，

2.这个有三种移动方法。

3.检查过的位置就不用检查了

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<queue>
#include<vector>
#define MAX 100010
using namespace std;
int n,k;
int step[MAX];
bool visited[MAX];
queue<int> bfstree;



int bfs()
{
    int head, next;

    memset(visited, false, sizeof(visited));
    visited[n] = 1;
    step[n] = 0;
    bfstree.push(n);

    while (!bfstree.empty())
    {
        head = bfstree.front();
        bfstree.pop();


        for (int i=0; i<3; ++i)
        {
            if (i==0) next=head-1;
            else if (i==1) next=head+1;
            else next = head*2;

            if (next<0||next>=MAX) continue;

            if(!visited[next])
            {
                visited[next] = 1;
                step[next] = step[head] + 1;
                bfstree.push(next);
            }

            if (next == k) return step[next];
        }
    }
    return -1;
}
int main()
{
    cin>>n>>k;
    cout<<bfs()<<endl;
    return 0;
}