A strange lift
来源:互联网 发布:js页面加载完成后执行 编辑:程序博客网 时间:2024/05/18 17:05
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1049 Accepted Submission(s): 494Problem 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 is on floor A,and you want to go to floor B,how many times at least he havt to press the button "UP" or "DOWN"?
Here comes the problem: when you is on floor A,and you want to go to floor B,how many times at least he havt 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 53 3 1 2 50
Sample Output
3
题目大意:一部电梯,每层都有一个数字,表示可以上升或下降这些,给出起始位置,问最少按键几次
#include<stdio.h>#include<string.h>#include<queue>#include<iostream>using namespace std;int n,s,e;int ss[205],vis[205];struct node{ int x,step;};int check(int x){ if(x<=0||x>n) return 1; return 0;}int BFS(){ queue<node>Q; node a,next; int i; a.x=s; a.step=0; vis[s]=1; Q.push(a); while(!Q.empty()) { a=Q.front(); Q.pop(); if(a.x==e) return a.step; for(i=-1;i<=1;i+=2) { next=a; next.x+=i*ss[next.x]; if(check(next.x) || vis[next.x]) continue; vis[next.x] = 1; next.step++; Q.push(next); } } return -1;}int main(){ int i,j; while(cin>>n) { if(n==0)break; cin>>s>>e; for(i=1;i<=n;i++) cin>>ss[i]; memset(vis,0,sizeof(vis)); cout<<BFS()<<endl; } return 0;}
阅读全文
1 0
- HDU A strange lift
- HDUOJ1548 A strange lift
- hdu1548 A strange lift
- HDOJ A strange lift
- A strange lift
- A strange lift(BFS)
- A strange lift
- A strange lift
- A strange lift
- HDU1548 A strange lift
- hdu_1548 A strange lift
- HDU A strange lift
- a strange lift
- HDU1548 A strange lift
- poj1548 A strange lift
- A strange lift
- A strange lift
- hdu1548 A strange lift
- redis介绍
- github使用教程
- 使用mybatis批量插入数据库自动生成主键
- unity用www加载图片出现一个问号。
- 关于web手机端资料
- A strange lift
- nrm —— 快速切换 NPM 源
- 常量池的理解
- C++设计模式五--AbstractFactoryPattern(抽象工厂模式)
- UITableView分割线短,左右侧都不顶格
- C# 将json字符串转换为键值对形式,用于执行form表单形式的请求
- 读《造房子》
- 实现敌人(怪物)的简单AI(自动巡逻、看到玩家攻击玩家、玩家离开恢复自动巡逻)
- 在finder中显示隐藏文件