广搜入门，poj3278

#include<iostream>
#include<queue>
using namespace std;


const int MAXN = 1000000;
int visit[MAXN];
struct Steps{
int stepNum;
int num;
Steps(int num_,int stepNum_):num(num_),stepNum(stepNum_){};
};
int N,K;
queue<Steps> step;
int main(){
int result(0);
memset(visit,0,sizeof(visit));
cin >> N >> K;
step.push(Steps(N,0));
visit[N] = 1;
while(!step.empty())
{
Steps top = step.front();
if(top.num == K)
{
result = top.stepNum;
break;
}
if(top.num - 1 >= 0 && visit[top.num - 1] == 0)
{
step.push(Steps(top.num - 1,top.stepNum + 1));
visit[top.num - 1] = 1;
}
if(top.num + 1 <= MAXN && visit[top.num + 1] == 0)
{
step.push(Steps(top.num + 1,top.stepNum + 1));
visit[top.num + 1] = 1;;
}
if(top.num * 2 <= MAXN && visit[top.num * 2] == 0)
{
step.push(Steps(top.num * 2,top.stepNum + 1));
visit[top.num * 2] = 1;
}
step.pop();
}
cout << result << endl;
}