<a target=_blank href="http://codeforces.com/contest/520/problem/B">点击打开链接</a>
题目大意是有2种操作,一是乘2,二是减1.现给你两个数n,m,要求求从n得到m所需要花费的次数。很自然的联想到搜索,对每次的结果进行标记修改,其中最为重要的是有两个进行交替计算来寻找最小步数。
#include<iostream>
#include<cstdio>
#include<queue>
#include<string.h>
#define Max 1000000
using namespace std;
struct node{
int num;
int step;
};
int vis[Max];
void bfs(int n,int m)
{
queue<node>q;
memset(vis,0,sizeof(vis));
vis[n]=1;
node st;
st.num=n,st.step=0;
q.push(st);
while(!q.empty())
{
node temp = q.front();
q.pop();
node cur1,cur2;
cur1=cur2=temp;
if(cur1.num==m)
{
printf("%d\n",cur1.step);
}
cur1.num*=2;
cur1.step++;
cur2.num-=1;
cur2.step++;
if(cur1.num>0&&cur1.num<Max&&!vis[cur1.num])
{
q.push(cur1);
vis[cur1.num]=1;
}
if(cur2.num>0&&cur2.num<Max&&!vis[cur2.num])
{
q.push(cur2);
vis[cur2.num]=1;
}
}
}
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(m<n)
{
printf("%d\n",n-m);
}
else if(n==m)
{
printf("0\n");
}
else
bfs(n,m);
}
return 0;
}