hdu 2717Catch That Cow 简单的广搜

#include<cstdio>
#include<iostream>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<iomanip>
#include<set>
#include<string>
#include<iterator>
#define maxn 10000000
using namespace std;
int N,K;
int visit[200010];
int step[200010];//记录所走的步数，重要的东东
void bfs(){
   queue<int> q;
   q.push(N);
   visit[N]=1;
   while(!q.empty()){
        int tmp=q.front();
        q.pop();
        if(tmp==K)
          cout<<step[K]<<endl;
        if(tmp-1>=0&&!visit[tmp-1]){
            visit[tmp-1]=1;
            q.push(tmp-1);
            step[tmp-1]=step[tmp]+1;

        }
        if(tmp+1<100000&&!visit[tmp+1]){
            visit[tmp+1]=1;
            q.push(tmp+1);
            step[tmp+1]=step[tmp]+1;

        }
        if(2*tmp<200000&&!visit[2*tmp]){//注意范围的判断
            visit[2*tmp]=1;
            q.push(2*tmp);
            step[2*tmp]=step[tmp]+1;

        }




   }




}
int main(){
  while(cin>>N>>K){
      memset(visit,0,sizeof(visit));
      memset(step,0,sizeof(step));
      bfs();




  }



}