题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1091
源代码:
#include<iostream>
#include<string.h>
#include<queue>
#include<stdio.h>
using namespace std;
int m,n;
int visit[100005];
struct node
{
int num,step;
}s;
bool operator <(node m,node n)
{
return m.step>n.step;
}
int bfs()
{
priority_queue<node>q;/*优先队列*/
node t,w;
q.push(s);
while(!q.empty())
{
t=q.top();
visit[t.num]=1;
q.pop();
for(int i=0;i<3;i++)
{
if(i==0) w.num=t.num+1;
else if(i==1) w.num=t.num-1;
else if(i==2)w.num=t.num*2;
if(w.num>100000||w.num<0) continue;
if(visit[w.num]==1) continue;
if(w.num!=n)
{
w.step=t.step+1;
q.push(w);
}
else return t.step+1;
}
}
}
int main()
{
int digit;
while(cin>>m>>n)
{
memset(visit,0,sizeof(visit));
if(m>=n)
{
cout<<m-n<<endl;
continue;
}
s.num=m;
//s.rare=-1;
s.step=0;
digit=bfs();
cout<<digit<<endl;
}
}