HDU 1548 A strange lift 题解

A strange lift

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 33697    Accepted Submission(s): 12038

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

 

Recommend

8600   |   We have carefully selected several similar problems for you:  1385 1142 1217 2066 2544 

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

本题为典型的bfs模板题

此处采用了一位的深度优先搜索

规定了方向

下面上我加上完全的注释

谁都能看懂的代码

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

 //Author:LanceYu
 #include<iostream>
 #include<string>
 #include<cstring>
 #include<cstdio>
 #include<fstream>
 #include<iosfwd>
 #include<sstream>
 #include<fstream>
 #include<cwchar>
 #include<iomanip>
 #include<ostream>
 #include<vector>
 #include<cstdlib>
 #include<queue>
 #include<set>
 #include<ctime>
 #include<algorithm>
 #include<complex>
 #include<cmath>
 #include<valarray>
 #include<bitset>
 #include<iterator>
 #define ll long long
 using namespace std;
 const double clf=1e-;
 //const double e=2.718281828;
 const double PI=3.141592653589793;
 const int MMAX=;
 //priority_queue<int>p;
 //priority_queue<int,vector<int>,greater<int> >pq;
 struct node
 {
     int x,step;
 };
 int n,start,last;
 int dir[][],vis[];//dir分为两个方向，向上和向下
 int bfs(int start,int last)
 {
     int i;
     queue<node> q;
     q.push(node{start,});
     vis[start]=;
     while(!q.empty())
     {
         node t=q.front();
         q.pop();
         if(t.x==last)
             return t.step;
         for(int i=;i<;i++)
         {
             int dx=t.x+dir[i][t.x];
             if(dx>=&&dx<n&&!vis[dx])//一维深度搜索
             {
                 vis[dx]=;
                 q.push(node{dx,t.step+});
             }
         }
     }
     return -;
 }
 int main()
 {
     int temp;
     while(scanf("%d",&n)!=EOF)//这里输入要分开,因为输入为0时停止
     {
         if(n==)
             return ;
         scanf("%d%d",&start,&last);
         memset(vis,,sizeof(vis));
         for(int i=;i<n;i++)//每一层的数据录入,包括两个方向
         {
             scanf("%d",&temp);
             dir[][i]=temp;
             dir[][i]=-temp;
         }
         int ans=bfs(start-,last-);//注意此处要-1,受到数组的限制和影响
             printf("%d\n",ans);
     }
     return ;
 }

2018-11-16　　01:05:38　　Author:LanceYu