POJ 3278 Catch That Cow

题目链接
Description

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 ,这个数每次操作可以+1或是-1或是*2（有范围），问最少几次操作可以到K ,很裸的bfs题其实，直接开一个数组保存每个数字的最小步骤即可

#include<stdio.h>
#include<queue>
using namespace std;
typedef long long int LLD;
const LLD MAX=1e5+5;
LLD ans[MAX],n,k;
queue<LLD>dui;
void bfs()
{
    while (!dui.empty())
    {
        LLD num=dui.front();
        if (k==num)
        {
            printf("%lld\n",ans[k]);
            return ;
        }
        dui.pop();
        if (num-1>=0&&num-1<=MAX-5&&ans[num-1]>ans[num]+1)
        {
            ans[num-1]=ans[num]+1;
            dui.push(num-1);
        }
        if (num+1>=0&&num+1<=MAX-5&&ans[num+1]>ans[num]+1)
        {
            ans[num+1]=ans[num]+1;
            dui.push(num+1);
        }
        if (num*2>=0&&num*2<=MAX-5&&ans[num*2]>ans[num]+1)
        {
            ans[num*2]=ans[num]+1;
            dui.push(num*2);
        }
    }
}
int main()
{
    fill(ans,ans+MAX,0x3f3f3f3f);
    scanf("%lld %lld",&n,&k);
    dui.push(n);
    ans[n]=0;
    bfs();
    return 0;
}