HDU-1548-A strange lift-bfs

一道基础广搜题

但是我全给忘完了，

重新梳理一遍

记得标记，

记得开结构体，

记得标记的数组清空啊

 

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

 

 题意：给出n、a、b，表示总共1-n层楼，求出从a到b层的最少步数

　　　有一个电梯，电梯只能上或下，接下去给出n个数，表示电梯如果到达这一层i的话可以向上或者向下走a[i]层，要是无法到达则输出-1

 

思路：广搜的一点点变形，将四个方向改为两个，向上或者是向下

细节：book数组标记记得清空啊

 1 #include<stdio.h>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<string.h>
 5 #include<vector>
 6 #include<cmath>
 7 #include<queue>
 8 #include<stdlib.h>
 9 typedef long long ll;
10 using namespace std;
11 
12 struct node
13 {
14     int x;
15     int ss;
16 } p,q;
17 
18 int aa[220];
19 int book[220];
20 int a,b,n;
21 
22 void bfs()
23 {
24     memset(book,0,sizeof(book));
25     queue<node>Q;
26     p.x=a;
27     p.ss=0;
28     Q.push(p);
29 
30     book[a]=1;
31     int ans=0;
32 
33     while(!Q.empty())
34     {
35         q=Q.front();
36         Q.pop();
37         if(q.x==b)
38         {
39             printf("%d\n",q.ss);
40             //  break;
41             return;
42         }
43         for(int i=0; i<=1; i++)
44         {
45             p=q;
46             if(i==0)
47                 p.x+=aa[p.x];
48             else
49                 p.x-=aa[p.x];
50             if(p.x>=1&&p.x<=n&&book[p.x]==0)
51             {
52                 p.ss=q.ss+1;
53                 book[p.x]=1;
54                 Q.push(p);
55             }
56         }
57     }
58     printf("-1\n");
59     return;
60 }
61 
62 int main()
63 {
64     while(~scanf("%d",&n))
65     {
66         if(n==0)
67             break;
68         scanf("%d %d",&a,&b);
69         for(int i=1; i<=n; i++)
70             scanf("%d",&aa[i]);
71         bfs();
72     }
73     return 0;
74 }

View Code

 

转载于:https://www.cnblogs.com/OFSHK/p/11462438.html