AC简捷代码给个点赞吧qwq

#include<bits/stdc++.h>
using namespace std;

const int N = 2e2+5;
int k [N],n,a,b,vis[N];

int bfs(int x)
{
	queue<pair<int,int> >q;
	q.push({x,0});
	vis[x]=1;
	while(!q.empty())
	{
		pair<int,int> cur=q.front();
		int u=cur.first,v=cur.second;
		q.pop();
		if(u==b)return v;
		if(u-k[u]>=1&&!vis[u-k[u]])
		{
			q.push({u-k[u],v+1});
			vis[u-k[u]]=1;
		}
		if(u+k[u]<=n&&!vis[u+k[u]])
		{
			q.push({u+k[u],v+1});
			vis[u+k[u]]=1;
		}
	}
	return -1;
}
int main()
{
	cin >> n >> a >> b;
	for(int i = 1;i <= n;i++)cin>>k[i];
	cout<<bfs(a);
	return 0;
}

#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 200 + 10;
const int INF = 0x3f3f3f3f;
int n , k , b ，x;
int a [N];
bool v [N];
struct node 
{
	int t , step;
};
queue < node > q;
void bfs ()
{
	q.push( (node) {k , 0});
	v [k] = 1;
	while (!q.empty())
	{
		node top = q.front();
		if ( top.t == b )
		{
			cout << top.step;
			exit (0);
		}
        q.pop();
		if ( !v [top.t - a [top.t]]  && top.t - a [top.t] >= 1)
		{
			v [top.t - a [top.t]] = 1;
			q.push ( (node) { top.t - a [top.t] , top.step + 1 });
		}
		    
		if ( !v [top.t + a [top.t]]  && top.t + a [top.t] <= n)
		{
			v [top.t + a [top.t]] = 1;
			q.push ( (node) { top.t + a [top.t] , top.step + 1 });
		}
	}
	cout << -1;
}
int main()
{
	    cin >> n >> k >> x;
	    for (int i = 1; i <= n; i++)
	        cin >> a [i];
  		return 0;
}

#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <complex.h>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <fenv.h>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <inttypes.h>
#include <limits>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <stdbool.h>
#include <stdint.h>
#include <tgmath.h>
#include <utility>
#include <vector>

using namespace std;

#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;

struct node{
	int pos , step;
};

int n , l , r , a[N]; 
bool v[N];

void bfs(int x){
	queue<node> q;
	q.push((node){x , 0});
	v[x] = 1;
	
	while(!q.empty()){
		node top = q.front();
		q.pop();
		
		if(top.pos == r){
			cout << top.step;
			exit(0);
		}
		
		if(top.pos + a[top.pos] <= n && !v[top.pos + a[top.pos]]){
			v[top.pos + a[top.pos]] = 1;
			q.push((node){top.pos + a[top.pos] , top.step + 1});
		}
		if(top.pos - a[top.pos] >= 1 && !v[top.pos - a[top.pos]]){
			v[top.pos - a[top.pos]] = 1;
			q.push((node){top.pos - a[top.pos] , top.step + 1});
		} 
	}
}
int main() {	
	cin >> n >> l >> r;
	for(int i = 1;i <= n;i++){
		cin >> a[i];
	}
	bfs(l);
	cout << -1;
    return 0;
}

#include<bits/stdc++.h> using namespace std; const int N=200+10; const int INF=0x3f3f3f3f; struct node { int pos,step; }; int n,l,r,a[N]; bool v[N]; void bfs(int x) { queue q; q.push((node){x,0}); v[x]=1; while(!q.empty()){ node top=q.front(); q.pop(); if(top.pos==r){ cout<<top.step; exit(0); } if(top.pos+a[top.pos]<=n&&v[top.pos+a[top.pos]]==0){ v[top.pos+a[top.pos]]=1; q.push((node){top.pos+a[top.pos],top.step+1}); } if(top.pos-a[top.pos]>0&&v[top.pos-a[top.pos]]==0){ v[top.pos-a[top.pos]]=1; q.push((node){top.pos-a[top.pos],top.step+1}); } }

} int main(){ cin>>n>>l>>r; for(int i=1;i<=n;i++){ cin>>a[i]; }

bfs(l);
cout<<-1;
return 0;

}