这是一道BFS入门题

A - 这是一道BFS入门题
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Description
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the button “UP” , you will go up Ki floor,i.e,you will go to the i+Ki th floor,as the same, if you press the button “DOWN” , you will go down Ki floor,i.e,you will go to the i-Ki th floor. Of course, the lift can’t go up high than N,and can’t go down lower than 1. For example, there is a buliding with 5 floors, and k1 = 3, k2 = 3,k3 = 1,k4 = 2, k5 = 5.Begining from the 1 st floor,you can press the button “UP”, and you’ll go up to the 4 th floor,and if you press the button “DOWN”, the lift can’t do it, because it can’t go down to the -2 th floor,as you know ,the -2 th floor isn’t exist.
Here comes the problem: when you are on floor A,and you want to go to floor B,how many times at least he has to press the button “UP” or “DOWN”?

Input
The input consists of several test cases.,Each test case contains two lines.
The first line contains three integers N ,A,B( 1 <= N,A,B <= 200) which describe above,The second line consist N integers k1,k2,….kn.
A single 0 indicate the end of the input.

Output
For each case of the input output a interger, the least times you have to press the button when you on floor A,and you want to go to floor B.If you can’t reach floor B,printf “-1”.

Sample Input
5 1 5
3 3 1 2 5
0

Sample Output
3

有一个序列 第一个数字对应在一楼，能往上或往下移动的层数，第二个数字对应第二层，以此类推。

#include "iostream"
#include "string.h"
#include "queue"
using namespace std;
int N,A,B;
int cnt;
int a[205];
bool mark[205]; //用来记录该点是否走过 走过了就不用再走了
int flag=false;
struct ehh
{
    int floor,step;
} m,n,o;
int main()
{
    while(scanf("%d",&N)!=EOF)
    {
        queue<ehh> q;  //大坑 一直WA 因为之前生命在全局的位置 忘记清了 这告诉我们要保持良好习惯
        flag=false;
        if(N==0)
            return 0;
        cin>>A>>B;
        memset(a,0,sizeof(a));
        memset(mark,false,sizeof(mark));
        for(int i=1;i<=N;i++)
        {
            cin>>a[i];
        }
        m.floor=A;
        m.step=0;
        q.push(m);
        //BFS
        while(!q.empty())
        {
            n=q.front();
            q.pop();
            if(n.floor==B)
            {
                flag=true;
                cout<<n.step<<endl;
                break;
            }

            if((n.floor-a[n.floor])>0&&(n.floor-a[n.floor])<=N&&!mark[n.floor-a[n.floor]])// 不会走到不存在的楼层 go down
            {
                o.floor=n.floor-a[n.floor];
                o.step=n.step+1;
                mark[o.floor]=true;
                q.push(o);
            }
            if((n.floor+a[n.floor])>0&&(n.floor+a[n.floor])<=N&&!mark[n.floor+a[n.floor]]) //go up
            {
                o.floor=n.floor+a[n.floor];
                o.step=n.step+1;
                mark[o.floor]=true;
                q.push(o);
            }

        }
        if(flag==false)
            cout<<"-1"<<endl;



    }
}