1013&&1014上下楼梯

Problem Description

There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 &lt;= Ki &lt;= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the button &quot;UP&quot; , 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 &quot;DOWN&quot; , 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 &quot;UP&quot;, and you'll go up to the 4 th floor,and if you press the button &quot;DOWN&quot;, 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.<br>Here comes the problem: when you is on floor A,and you want to go to floor B,how many times at least he havt to press the button &quot;UP&quot; or &quot;DOWN&quot;?<br>

 

Input

The input consists of several test cases.,Each test case contains two lines.<br>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.<br>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<br>3 3 1 2 5<br>0
  
  

 

Sample Output

  
  

   
   3
  
  
  
  

   
   题意：
  
  
  
  

   
   楼梯有起始点，a，b，,有N种情况要移动的楼梯数用K[]表示，要求从起点到终点所移动的最小楼梯数；要注意的是:
  
  
  
  

   
   一开始的选择有两种UP*x||DOWN*x,要注意到一开始的X即为起点&&k[a]对应的值，下一次搜索起点又是一一映射的关系，不断循环遍历即可得最小步数，因为是BFS；
  
  
  
  

   
   代码：
  
  
  
  

   
   
   
   

    
    #include<iostream>
#include<string>
#include<queue>
using namespace std;
int k[200],vis[200];
int n,a,b;
struct floor
{
 int x;
 int move;
};
int bfs(int a,int b,int n)
{
 queue<int>q;
 floor f1,f2;
 f1.x=a;
 f1.move=0;
   
   
   
   

    
      q.push(f1);
    while(!q.empty())
 {
  f1=q.front();
  q.pop();
  if(f1.x==b)
   return f1.move;
  if(f1.x+k[f1.x]<=n&&!vis[f1.x+k[f1.x]])//对楼层的合法性进行选择
  {
   f2.move=f1.move+1;
   f2.x=f1.x+k[f1.x];
   vis[f1.x+k[f1.x]]=1;
   q.push(f2);
  }
  if(f1.x-k[f1.x]>=1&&vis[f1.x+k[f1.x]])
  {
   f2.move=f1.move+1;
   f2.x=f1.x+k[f1.x];
   vis[f1.x+k[f1.x]]=1;
   q.push(f2);
  
  }
  return -1;
   
   
   
   


   
   
   
   

    
     }
}
int main()
{
 while(cin>>n&&n)
 {
   
   
   
   

    
       memset(vis,0,sizeof(vis));
  cin>>a>>b;
  for(int i=0,i<n;i++)
  {
   cin>>k[i];
  
  }
  cout<<bfs(a,b,n)<<endl;
 }
 return 0;
}