HDOJ 1548：A strange lift (BFS+队列)

A strange lift

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 <= 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

翻译版：

**一个奇怪的升降机。升降机可以根据需要停在每个楼层，每层都有一个Ki（0 <= Ki <= N）。电梯只有两个按钮：上下。当你在楼层i，如果你按下“UP”按钮，你会上升Ki楼层，即你会去i + Ki楼层，如果你按下“DOWN”按钮，你会下去Ki楼，即您将前往i-Ki楼层。当然，升力不能高于N，并且不能低于1.例如，有5层的建筑物，k1 = 3，k2 = 3，k3 = 1，k4 = 2，k5 = 5.从1楼开始，你可以按下“UP”按钮，你就到了4楼，如果你按下“DOWN”按钮，电梯就不能做它，因为它不能下到-2楼，如你所知，
问题出在这里：当你在A楼，你想要去B楼时，至少他必须按下“UP”或“DOWN”按钮多少次？

输入
输入包含几个测试用例。每个测试用例包含两行。
第一行包含三个整数N，A，B（1 <= N，A，B <= 200），如上所述，第二行包括N个整数k1，k2，… kn。
单个0表示输入结束。
输出
对于输入输出的每个情况一个整数，当你在A楼时你必须按下按钮的次数最少，而你想要去B楼。如果你不能到达B楼，则打印“-1”。**

流程：

思路：

这道题类似于BFS迷宫
整体思路：如上图，红叉为不能走的路，只能走通的路，如果能到达终点输出步数，相反则输出-1，即为不能到达想要到达的层数。
细节的思路