poj 3278 Catch that cowBFS

问题描述：

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?

输入：带有空格的两个整数:n,k

输出：最小的时间

例如：输入5 17  输出：4

分析：

属于广搜的基础知识题目，分三种情况，-1，+1，*2，判断入队时的谁先达到k值

int BFS(int n,int k)
{
  int head,next;
  x.push(n);//n入队
  visited[n]=true;//标记为已访问过
  step[n]=0;//起始步数为0
  while(!x.empty())  //队列非空
  {
      head=x.front();//将队首赋给head
      x.pop();//弹出队头
      //3个方向搜索
      for(int i=0;i<=2;i++)
      {
          if(i==0)   next=head-1;
          else if(i==1)  next=head+1;
          else   next=head*2;
          if(next>Size||next<0)  continue;
          if(!visited[next])//没有访问过
          {
             x.push(next);//入队
             step[next]=step[head]+1;
             visited[next]=true;
          }
          if(next==k)  return step[next];

      }
  }
}

完整程序如下：

#include <iostream>
#include <queue>
#define Size 100001
using namespace std;
queue<int> x;
bool visited[Size];
int step[Size];
int BFS(int n,int k)
{
  int head,next;
  x.push(n);//n入队
  visited[n]=true;//标记为已访问过
  step[n]=0;//起始步数为0
  while(!x.empty())  //队列非空
  {
      head=x.front();//将队首赋给head
      x.pop();//弹出队头
      //3个方向搜索
      for(int i=0;i<=2;i++)
      {
          if(i==0)   next=head-1;
          else if(i==1)  next=head+1;
          else   next=head*2;
          if(next>Size||next<0)  continue;
          if(!visited[next])//没有访问过
          {
             x.push(next);//入队
             step[next]=step[head]+1;
             visited[next]=true;
          }
          if(next==k)  return step[next];

      }
  }
}

int main()
{
   int n,k;
   cin>>n>>k;
   if(n>=k)
   {
       cout<<n-k<<endl;
   }
   else
    {
      cout<<BFS(n,k)<<endl;

    }
    return 0;
}