HDU【1875】A strange lift
来源:互联网 发布:淘宝叶子类目是什么 编辑:程序博客网 时间:2024/04/29 11:45
A strange lift
Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u
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 <iostream>#include <cstdio>#include <cstring>using namespace std;const int INF = 999999999;const int maxn = 200 +5;struct Edge{ int from,to,dis,next;};Edge e[10000005];int d[maxn];int v[maxn];int pre[maxn];int main(){ int n,a,b,i,j,y; while(scanf("%d",&n)!=EOF&&n!=0) { scanf("%d%d",&a,&b); int sum = 1; memset(v,0,sizeof(v)); memset(pre,-1,sizeof(pre)); for(i = 1;i <= n;i++) { scanf("%d",&y); if((i + y)>0&&(i + y) <= n) { e[sum].from = i; e[sum].to = i + y; e[sum].dis = 1; e[sum].next = pre[i]; pre[i] = sum; sum++; } if((i - y)>0&&(i - y) <= n) { e[sum].from = i; e[sum].to = i - y; e[sum].dis = 1; e[sum].next = pre[i]; pre[i] = sum; sum++; } } for(i = 1;i <= n;i++) d[i] = (i == a ? 0:INF); for(i = 1 ; i <= n; i++) { int x,minn=INF; for(j = 1; j <= n; j++) if(!v[j] && d[j] <= minn) minn = d[x = j]; v[x] = 1; for(j = pre[x] ;j != -1 ; j = e[j].next) { if(d[e[j].to] > d[x] + e[j].dis) d[e[j].to] = d[x] + e[j].dis; } } d[b] = (d[b] == INF? -1:d[b]); cout << d[b] << endl; } return 0;}
0 0
- HDU【1875】A strange lift
- HDU A strange lift
- HDU A strange lift
- A strange lift HDU
- A strange lift HDU
- HDU 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
- 进程控制-创建子进程
- 分享一个网页背景图与div居中的方法
- leetcode217---Contains Duplicate(是否有重复数)
- 开始写博客,毕业一年的收获
- TBD socket client请求,在向远端ip:port发送时,会随机找个本地可用端口去向远端ip:port 发起net io write操作。远端accept后的sockets都共享一个端口
- HDU【1875】A strange lift
- 情怀之下,唯张小龙一人而
- 计算结构体偏移量
- Fragment
- mysql开启远程访问
- 介绍几个C++程序中关于"时间"的函数
- 怎么把plist文件转换成JSON 文件 ,在把JSON文件转换成字典或者数组
- 数据解析
- 服务端开发工程师须知(杂编)