杭电 HDU 1548 A strange lift
来源:互联网 发布:js给div添加click事件 编辑:程序博客网 时间:2024/05/21 01:54
http://acm.hdu.edu.cn/showproblem.php?pid=1548
A strange lift
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8225 Accepted Submission(s): 3127
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
广搜(Bfs)题
AC代码:
#include<iostream>#include<cstdio>#include<queue>#include<cstring>using namespace std;struct Node{ int f; int i;};int floor[210];int yn[210];int Bfs(int n, int a, int b){ Node now,next; queue<Node> q; now.f = a; now.i = 0; q.push(now); while(!q.empty()) { now = q.front(); q.pop(); yn[now.f] = 2; //标记此楼已经到达 // printf("%d %d\n",now.f,now.i); if(now.f == b) //判断是否到达指定楼层 { return now.i; } else { next.i = now.i+1; next.f = now.f+floor[now.f]; //向上走 if(next.f > 0 && next.f <= 200 && yn[next.f] == 0) { yn[next.f] = 1; //标记此楼 q.push(next); } next.f = now.f-floor[now.f]; //向下走 if(next.f > 0 && next.f <= 200 && yn[next.f] == 0) { yn[next.f] = 1; //标记此楼 q.push(next); } } } return -1;}int main(){ int n,a,b; int i,num; while(scanf("%d",&n)&&n) { memset(yn,0,sizeof(yn)); for(i = 0; i< 210; i++) { floor[i] = 1000; } scanf("%d%d",&a,&b); for(i = 1; i <= n; i++) { scanf("%d",&floor[i]); } num = Bfs(n,a,b); printf("%d\n",num); } return 0;}
- 杭电 hdu 1548 A strange lift
- 杭电 hdu 1548 A strange lift
- 杭电 HDU 1548 A strange lift
- 【搜索之BFS】杭电 hdu 1548 A strange lift
- HDU--杭电--1548--A strange lift--最短路
- 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
- 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
- DFS 待遍历的元素被多次访问
- JavaScript中的正则表达式快速入门
- linux 下静默安装tuxedo
- sqlserver表中数据类型值对应名称
- mfs文件系统配置安装
- 杭电 HDU 1548 A strange lift
- Win7下由于更新netframework 4.5导致vs2012报错无法打开vc的项目
- 经典面试题 之 递归调用 几个经典示例
- 南华大学个人练习第4场 Problem D: 弹球II
- php list each 访问数组
- crontab 使用小结
- Mybatis Generator实现分页功能
- POJ - 2299 Ultra-QuickSort【归并排序】
- ARM9 core + MMU + Cache