hdu 1548
来源:互联网 发布:java实现建军照合成 编辑:程序博客网 时间:2024/04/29 05:56
链接: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): 9964 Accepted Submission(s): 3738
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<iostream>#include<cstring>#include<cstdio>#include<queue>int n,a,b;const int maxn=205;const int inf=1<<20;int map[maxn][maxn];bool used[maxn];int dis[maxn];int k[maxn];using namespace std;void init(){ for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) map[i][j]=(i==j?0:inf); memset(used,0,sizeof(used));}void spfa(){ for(int i=0;i<=n;i++){ dis[i]=inf; } dis[a]=0; queue <int> q; q.push(a); used[a]=1; while(!q.empty()){ int mid; mid=q.front(); q.pop(); used[mid]=0; for(int j=1;j<=n;j++){ if(map[mid][j]+dis[mid]<dis[j]){ dis[j]=map[mid][j]+dis[mid]; if(!used[j]){ q.push(j); used[j]=1; } } } }}int main(){ //freopen("in.txt","r",stdin); while(cin>>n,n){ cin>>a>>b; init(); for(int i=1;i<=n;i++){ cin>>k[i]; } for(int i=1;i<=n;i++){ if(i+k[i]<=n) map[i][i+k[i]]=1; if(i-k[i]>=1) map[i][i-k[i]]=1; } spfa(); if(dis[b]<inf) cout<<dis[b]<<endl; else cout<<"-1"<<endl; } return 0;}
0 0
- hdu 1548
- hdu 1548
- hdu 1548
- hdu 1548
- HDU 1548
- hdu 1548
- HDU 1548
- hdu 1548
- hdu 1548
- HDU 1548
- HDU 1548
- hdu-1548
- hdu 1548
- HDU 1548
- hdu 1548
- hdu 1548
- HDU-1548
- hdu 1548
- java.lang.IllegalStateException: Could not find a method add(View) in the activity class haha.com.e
- W/ResourceType( 4896): Bad XML block: header size 215 or total size 0 is larger than data size 0
- 触动的话语,为自己而活
- \res\menu\main.xml:3: error: Error: No resource found that matches the given name (at 'title' with
- 帝国cms内容页模版修改更新但是页面上没有反应,页面没有体现修改是什么原因?
- hdu 1548
- c链表实现
- 网络流基础模板
- poj 2096 Collecting Bugs(概率dp)
- 我推荐的一些C\C++书籍
- 2013级C++第4周(春)项目——再和对象找感觉 【项目4扩展2(选做)】
- 内存对齐问题
- Pat(Advanced Level)Practice--1031(Hello World for U)
- codeforces round236 DIV2