ACM竞赛学习记录------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+1,n-1,n*2三种坐标移动方式，我们要找出最小的迁移次数来到达n点，输出最小迁移次数。

解题思路：典型的广度优先探索题，注意定义一个vis数组记录已经访问过的点，不要重复访问，浪费实际。

AC代码

#include <cstdlib>
#include <iostream>
#include <stdlib.h>     /* qsort */
#include <algorithm>
#include<queue>
using namespace std;
int n, k;
int vis[