1.题目描述:
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24214 Accepted Submission(s): 8762
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"?
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.
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
某人从a坐电梯到b,有k个按钮,第i个按钮表示可以上升或者下降ki层,注意边界条件是不能到负层或者大于顶层,问你到b最少按几次。
3.解题思路:
这种最少最短问题都可以考虑用bfs解决
4.AC代码:
#include <queue>
#include <stdio.h>
#define maxn 202
#define INF 0x3f3f3f3f
using namespace std;
int i, n, a, b, flo;
int vis[maxn], k[maxn], step[maxn];
void bfs()
{
queue<int> Q;
Q.push(a);
step[a] = 0;
while (!Q.empty())
{
flo = Q.front();
if (flo == b)
break;
Q.pop();
vis[flo] = 0;
if (flo + k[flo] <= n && flo + k[flo] >= 1)
if (vis[flo + k[flo]] && step[flo] + 1 <= step[flo + k[flo]])
{
step[flo + k[flo]] = step[flo] + 1;
Q.push(flo + k[flo]);
}
if (flo - k[flo] <= n && flo - k[flo] >= 1)
if (vis[flo - k[flo]] && step[flo] + 1 <= step[flo - k[flo]])
{
step[flo - k[flo]] = step[flo] + 1;
Q.push(flo - k[flo]);
}
}
}
int main()
{
while (scanf("%d", &n) != EOF && n)
{
scanf("%d%d", &a, &b);
for (i = 1; i <= n; i++)
{
scanf("%d", &k[i]);
vis[i] = 1;
step[i] = INF;
}
bfs();
if (flo == b)
printf("%d\n", step[b]);
else
puts("-1");
}
return 0;
}