A strange lift(dfs)

Problem:A strange lift

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

Language:C++

#include <iostream>
#include <cstring>
#define INF 0x3f3f3f3f

using namespace std;

int N,A,B;
int k[201];
bool vis[201];
int ans;

void dfs(int now,int sum)
{
  if(now==B)  ans=min(ans,sum);
  if(sum==ans) return;//剪枝优化，去掉会tle

  vis[now]=1;
  if(now+k[now]<=N&&!vis[now+k[now]]) dfs(now+k[now],sum+1);//找到电梯上升出口，操作次数+1
  if(now-k[now]>=1&&!vis[now-k[now]])  dfs(now-k[now],sum+1);//找到电梯下降出口，操作次数+1
  vis[now]=0;
}

int main()
{
  while(cin>>N&&N)
  {
    ans=INF;
    memset(vis,0,sizeof(vis));
    
    cin>>A>>B;
    for(int i=1;i<=N;i++) cin>>k[i];
  
    dfs(A,0);
    if(ans!=INF) cout<<ans<<endl;
    else  cout<<-1<<endl;
  }
  return 0;
}