A strange lift

原创 2016年05月30日 20:51:15
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
 

AC代码:

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
int T,N,A,B;
int mp[220],f[220];
void BFS(){
	queue<int>q;
    q.push(A);
    f[A]=1;
    int t;
    while(!q.empty()){
        t=q.front();
        q.pop();
        if(t==B)break;
        int next=t+mp[t];
        if(next>=1&&next<=B&&f[next]==0){
            q.push(next);
            f[next]=f[t]+1;
        }
        next=t-mp[t];
        if(next>=0&&next<=B&&f[next]==0){
            q.push(next);
            f[next]=f[t]+1;
        }
    }
    if(t!=B)
        f[B]=0;
}
int main()
{
	int i,j;
	while(cin>>N){
		if(N==0)break;
		cin>>A>>B;
		for(i=1;i<=N;i++)
		cin>>mp[i];
		memset(f,0,sizeof(f));
		BFS();
		cout<<f[B]-1<<endl;
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU 1548 A strange lift

There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0...

HDU 1548 A strange lift 简单广搜

A strange lift Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...

(BFS)A strange lift--HDOJ

A strange lift Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) To...

A strange lift

B - A strange lift Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d &...

hdu 1548 A strange lift(BFS)

原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=1548 题目大意: N个数从A层开始到B层 N层依次能上升或者下降的层数 ...

SDAU 搜索专题 13 A strange lift

1:问题描述 Problem Description There is a strange lift.The lift can stop can at every floor as you wan...

ACM-BFS之A strange lift——hdu1548

ACM BFS A strange lift hdu1548

HDU 1548 A strange lift【不错的最短路,spfa】

n代表楼梯层数,A代表起始位置,B代表终止位置,接下来有n个数,代表到达每一层后,可以选择按 按钮“UP”,“DOWN” ,代表执行此操作后电梯可上升或下降的层数(注意:是变化的层数,且合法...

杭电 hdu 1548 A strange lift

/* THE PROGRAM IS MADE BY PYY */ /*-----------------------------------------------------------------...

HDU 1548 A strange lift(简单BFS)

http://acm.hdu.edu.cn/showproblem.php?pid=1548 A strange liftTime Limit: 2000/1000 MS (Java/Others)...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)