hdoj 1548 A strange lift
来源:互联网 发布:mac matlab2017a激活 编辑:程序博客网 时间:2024/06/06 19:37
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13638 Accepted Submission(s): 5210
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 53 3 1 2 50
Sample Output
3
第一道广搜。。。
#include<stdio.h>#include<queue>#define max 200+10using namespace std;int floo[max];int visit[max];//标记 int step[max];//记录次数 int n;void bfs(int start,int end){ queue<int>num;//每次要重建队列。。。 int now,next; int exist=0; num.push(start);//进 visit[start]=1; while(!num.empty())//队列为空时 { now=num.front();//当前阶梯 num.pop();//删 if(now==end) { exist=1;//能到达 break; } next=now-floo[now];//down if(!visit[next]&&next>=1&&next<=n) { step[next]=step[now]+1; visit[next]=1; num.push(next);//进 } next=now+floo[now];//up if(!visit[next]&&next>=1&&next<=n) { step[next]=step[now]+1; visit[next]=1; num.push(next);//进 } } if(exist) printf("%d\n",step[end]); else printf("-1\n");} int main(){ int i,j; int start,end; while(scanf("%d",&n)&&(n!=0)) { scanf("%d%d",&start,&end); for(i=1;i<=n;i++) { scanf("%d",&floo[i]); visit[i]=step[i]=0; } bfs(start,end); } return 0;}
0 0
- hdoj 1548 A strange lift
- HDOJ 1548 A strange lift
- HDOJ A strange lift
- hdoj 1548 A strange lift(bfs)
- HDOJ 1548 A strange lift (bfs)
- HDOJ 1548 A strange lift (BFS)
- hdoj 1548 A strange lift (BFS)
- HDOJ 1548 A strange lift (BFS)
- HDU/HDOJ 1548 A strange lift BFS,DFS
- (BFS)A strange lift--HDOJ
- A strange lift hdu 1548
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- HDU 1548 A strange lift
- Hdu-1548 A strange lift
- HDU 1548 A strange lift
- HDU-1548-A strange lift
- hdu 1548 A strange lift
- java 图
- 浏览器如何渲染网页?
- Hibernate继承映射(@Inheritance)
- (题目64)题目1190:大整数排序
- GDOI 3.21 模拟总结
- hdoj 1548 A strange lift
- 安装ARBOTIX SIMULATOR
- C++编译错误解决
- 大菲波数(hdu1715,大数加法)
- 本周查漏补缺
- Java多线程3 --- 多线程处理文件压
- How to install clang on Ubuntu 14.04
- JAVASE_面向对象上
- shell十三问之16:学习总结与原帖目录