HDU - 2717

最新推荐文章于 2019-03-18 20:48:45 发布

一条菜狗

最新推荐文章于 2019-03-18 20:48:45 发布

阅读量293

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/CSUstudent007/article/details/83714149

版权

ACM 专栏收录该内容

90 篇文章 1 订阅

订阅专栏

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<fstream>
#include<queue>
#define MAX 100010
#define next _next
using namespace std;
int n,k;
int  cur,next;
int step[MAX];
queue<int>q;
void bfs()
{
        while(!q.empty())
        {
              cur=q.front();
              q.pop();
              if(cur==k)  break;
              next=cur-1;
              if(next>=0&&step[next]==0)
              {
                      q.push(next);
                      step[next]=step[cur]+1;
              }
              next=cur+1;
              if(step[next]==0)
              {
                      q.push(next);
                      step[next]=step[cur]+1;
              }
              next=cur*2;
              if(next<=100000&&(next-k)<(k-cur)&&step[next]==0)
              {
                      q.push(next);
                      step[next]=step[cur]+1;
              }
        }

}
int main()
{
       while(scanf("%d%d",&n,&k)!=EOF)
       {
              memset(step,0,sizeof(step));
              if(n>k)
                      cout<<(n-k)<<endl;
               else
                   {
                        while(!q.empty()) q.pop();
                        q.push(n);
                        bfs();
                        cout<<step[k]<<endl;
                   }
       }
       return 0;
}