hdu 1548 A strange lift

#include <iostream>
#include <stdio.h>
#include <memory.h>
#include <queue>
using namespace std;
int n,a,b,t,step,flag;
int k[201],vis[201]={0};

struct node{
 int x;
 int step;
}pos,now,nxt;
void bfs(){
 //flag=0;
 int tt[2]={-1,1};
 pos.step=0;
 pos.x=a;
 queue<node> q;
 q.push(pos);
 vis[pos.x]=1;
 while(!q.empty()){
  now=q.front();
  q.pop();
  if(now.x==b)
  {
   step=now.step;
   flag=1;
   break;
  }
  for(int i=0;i<2;i++)
  {
   t=now.x+tt[i]*k[now.x];
   if(t>0&&t<=b&&vis[t]==0)
   {
    //nxt=now;
    nxt.x=t;
    nxt.step=now.step+1;//错误点2 
    q.push(nxt);
    vis[t]=1;
   }
  }
 }
}

int main() {
 
 while(cin>>n,n)
 {
  if(n==0)break;
  cin>>a>>b;
  for(int i=1;i<=n;i++)
  {
   cin>>k[i];
   vis[i]=0;//错误点1 
  }
  flag=0;
  bfs();
  if(flag)
   cout<<step<<endl;//没问题 
  else
   cout<<-1<<endl;
    }
    return 0;
}