#include<iostream>
#include<string.h>
using namespace std;
int a[200010];
int b[200010];
int p[200010];
int main()
{
    int n,k;
    int i,j;
    while(cin>>n>>k)
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        memset(p,0,sizeof(p));
        a[0]=n;
        p[n+1]=1;
        b[0]=0;
        i=0;
        j=1;
        while(i<j)
        {
            if(a[i]==k) break;

            if((a[i]-1)>=0&&!p[a[i]])
            {
            a[j]=(a[i]-1);
            b[j]=b[i]+1;
            ++j;
            }
            if((a[i]+1)<=100000&&!p[a[i]+2])
            {
            a[j]=(a[i]+1);
            b[j]=b[i]+1;
            ++j;
            }
            if((2*a[i])<=100000&&!p[a[i]*2+1])
            {
            a[j]=2*a[i];
            b[j]=b[i]+1;
            ++j;
            }
            
            i++;
        }
        cout<<b[i]<<endl;


    }



    return 0;
}

• Re:谁能帮我看看为什么一直WA呢 (1074) 871911211 2011-07-07 11:21:16