百练+BFS，记得vis标记，不然TLE

点击打开链接

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include <limits.h>
#include <assert.h>
#include<queue>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
int N=0,K=0;
struct Node{
    int x,steps;
};
int vis[100010]={0};//使用vis数组 去除重复状态，防止TLE
queue<Node> Q;
void BFS()
{
    while (!Q.empty()) Q.pop();
    Node temp1, temp2;
    temp1.x=N,temp1.steps=0;
    Q.push(temp1); vis[temp1.x] = 1;
    while (!Q.empty()) {
        temp1 = Q.front(); Q.pop();
        if(temp1.x==K){
            printf("%d\n",temp1.steps);
            return;
        }
        temp2 =temp1;
        if(2*temp2.x>=0&&2*temp2.x<=100000&&!vis[2*temp2.x]){
            temp2.x=2*temp2.x; temp2.steps+=1;
            Q.push(temp2);
            vis[temp2.x]=1;
        }
        temp2 =temp1;
        if(temp2.x+1>=0&&temp2.x+1<=100000&&!vis[temp2.x+1]){
            temp2.x+=1; temp2.steps+=1;
            Q.push(temp2);
            vis[temp2.x]=1;
        }
        temp2 =temp1;
        if(temp2.x-1>=0&&temp2.x-1<=100000&&!vis[temp2.x-1]){
            temp2.x-=1; temp2.steps+=1;
            Q.push(temp2);
            vis[temp2.x]=1;
        }
    }
}
int main()
{
    scanf("%d %d",&N,&K);
    if(N>=K) printf("%d\n",N-K);
    else BFS();
    return 0;
}