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;
}


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

hdu1548 A strange lift 不错的变相最短路考察

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

HDU 1548 A strange lift(最短路问题Dijkstra & bfs两种解法)

Problem Description There is a strange lift.The lift can stop can at every floor as you want, and t...

BFS 搜索 Problem 1013 A strange lift

Problem ID:1013 A strange lift 简单题意:在一个特殊的电梯中,如果你当前在第i层,按up则向上走ki层,按down则向下走ki层。如果将要到达的楼层n,则按up或d...

[最短路径、BFS] HDU 1548 - A strange lift

题意简述: 第一行输入三个整数N、A、B,分别代表楼的层数,开始楼层和结束楼层。 第二行输入N个整数,代表在当前楼层只能向上或向下移动的层数。 问从楼层A到楼层B至少需要按几次?如果...

HDU1548-A strange lift【广搜做法】

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

HDU1548 A strange lift

马上蓝桥杯了,找了些bfs的题目练练手,因为作死报的java组,实在是有些惶恐 There is a strange lift.The lift can stop can at every...

HDU 1548 A strange lift (简单BFS)

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

A strange lift(2013.09.15)

F. A strange lift Time Limit: 1000ms Case Time Limit: 1000ms Memory Limit: 32768KB 64-bi...
  • SIOFive
  • SIOFive
  • 2013年09月30日 22:57
  • 710

课程练习二-1013-A strange lift

Problem Description There is a strange lift.The lift can stop can at every floor as you want, and t...

hdu 1548 A strange lift

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1548 本题为简单最短路,构图方法为如果在第i层可以上升Ki层则增加边i - >(i+Ki) 否则不加...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:A strange lift
举报原因:
原因补充:

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