64pts，悬关求条

#include<bits/stdc++.h>
using namespace std;
int n,a,b,num[201],visited[201],dp[201];
int dfs(int x){
	visited[x]=1;
	int res=INT_MAX/2;
	if(dp[x]!=-1) return dp[x];
	if(x==a) return dp[a]=0;
	for(int i=1;i<=n;i++){
		if(x-i==num[i]||i-x==num[i]){
			if(visited[i]) continue;
			res=min(res,dfs(i)+1);//
		}
	}
	dp[x]=res;
	visited[x]=0;
	return dp[x];
}
int main(){
	memset(dp,-1,sizeof(dp));
	cin>>n>>a>>b;
	for(int i=1;i<=n;i++)
		cin>>num[i];
	int t=dfs(b);
	for(int i=1;i<=n;i++)
		cout<<dp[i]<<endl;
	if(t==INT_MAX/2)  cout<<"-1";
	else cout<<t;
	return 0;
}