题目意思:hdu1548,每层电梯上有个数字k,可以往上k层或向下k层,问从a层到b层至少需要多少步,如不能到达则输出-1。
解题思路:水题,bfs,连坑都没有。
代码明细:
//probID: hdu1548
//author: WiselyQY
//date: 2020-01-
#include <bits/stdc++.h>
using namespace std;
const int INF=1<<30;
struct Node
{
int level, step;
};
int n,s,e,g[205],vis[205],ans;
queue<Node> q;
const int d[]={1,-1};
void bfs()
{
while(!q.empty()) q.pop();
memset(vis,0,sizeof(vis));
vis[s]=1;
Node u;
u.level=s; u.step=0;
q.push(u);
while(!q.empty())
{
u=q.front(); q.pop();
int level=u.level, step=u.step;
if(level==e) {ans=step; return;}
for(int i=0; i<2; i++)
{
int nlevel=level+d[i]*g[level];
if(nlevel<1 || nlevel>n || vis[nlevel]) continue;
vis[nlevel]=1;
Node nu;
nu.level=nlevel; nu.step=step+1;
q.push(nu);
}
}
}
int main()
{
clock_t start,end;
start=clock();
#ifndef ONLINE_JUDGE
freopen(R"(D:\hdu\1548_2\in.txt)","r",stdin);
#endif
while(cin>>n && n)
{
cin>>s>>e;
for(int i=1; i<=n; i++) cin>>g[i];
ans=INF;
bfs();
if(ans==INF) cout<<"-1"<<endl;
else cout<<ans<<endl;
}
end=clock();
//printf("time=%lfs\n",(double)(end-start)/1000);
return 0;
}