3287POJ

给你两个数字，a,b,问你进行 a加减或者乘2操作最少几步到达b

这样的问题我们很容易想到广搜，有三个方向的广搜，不断更新最小步数就好。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

struct node
{
    int len;
    int step;
} x,y,z;

int vis[100009];

int main()
{
    int n,m;
    int ans;
    queue<node>Q;
    while(~scanf("%d%d",&n,&m))
    {
        x.len = n;
        x.step = 0;
        while(!Q.empty())Q.pop();
        memset(vis,0,sizeof(vis));
        Q.push(x);
        while(!Q.empty())
        {
            y = Q.front();
            Q.pop();
            if(y.len == m)
            {
                ans = y.step;
                break;
            }
            else
            {
                if(y.len - 1>=0&&!vis[y.len-1])
                {
                    vis[y.len - 1] = 1;
                    z.len = y.len - 1;
                    z.step = y.step + 1;
                    Q.push(z);
                }
                if(y.len + 1<=100000&&!vis[y.len+1])
                {
                    vis[y.len + 1] = 1;
                    z.len = y.len + 1;
                    z.step = y.step + 1;
                    Q.push(z);
                }
                if(y.len*2<=100000&&!vis[y.len*2])
                {
                    vis[y.len*2] = 1;
                    z.len = y.len*2;
                    z.step = y.step + 1;
                    Q.push(z);
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}