poj-3278-Catch That Cow

基础BFS：

程序：

#include<cstdio>
#include<string.h>
#include<iostream>
#include<algorithm> 
#include<cstring>
#include<queue>
using namespace std;

#define maxn 1000010
int visited[maxn];
struct step
{
    int x;
    int steps;
    step(int xx,int s):x(xx),steps(s){}
};

int main()
{
    int n,k;
    while(scanf("%d %d",&n,&k)!=EOF)
    {
        memset(visited,0,sizeof(visited));
        queue<step> q;
        q.push(step(n,0));
        visited[n]=1;
        while(!q.empty())
        {
            step s=q.front();
            if(s.x==k)
            {
                cout<<s.steps<<endl;
                break;
            }
            else
            {
                if(s.x-1>=0&&!visited[s.x-1])
                {
                    q.push(step(s.x-1,s.steps+1));
                    visited[s.x-1]=1;
                }
                if(s.x+1<=maxn&&!visited[s.x+1])
                {
                    q.push(step(s.x+1,s.steps+1));
                    visited[s.x+1]=1;
                }
                if(s.x*2<=maxn&&!visited[s.x*2])
                {
                    q.push(step(s.x*2,s.steps+1));
                    visited[s.x*2]=1;
                } 
                q.pop();
            }
        }
    }
    return 0;
}