HDU1548：A strange lift Dijkstra
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"?
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.
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 5
3 3 1 2 5
0
Sample Output
3
题意：给出楼层数n，起始楼层和目的楼层；问最少经过几次的UP或者DOWN可以到达目的楼层
UP，会上升到i+k[i]层；DOWN会下降到i-k[i]层
所给数据中1-UP->4-UP->6超,回到4-DOWN->2-UP->5
有三步
1 #include<stdio.h>
2 #include<iostream>
3 #include<string.h>
4 #define max 0x3f3f3f3f
5
6 using namespace std;
7
8 int main()
9 {
10 int n,a,b,x;
11 int i,j,k,min;
12 int floor[201][201],f[201],used[201];
13 while(scanf("%d",&n)&&n)
14 {
15
16 memset(used,0,sizeof(used));
17 scanf("%d %d",&a,&b);
18
19 for(i=1;i<=n;i++)
20 {
21 for(j=1;j<=n;j++)
22 floor[i][j]=max;
23
24 scanf("%d",&x);///下面记录该楼层可到达的楼层，记为1
25 if(i+x<=n)
26 floor[i][i+x]=1;
27 if(i-x>=1)
28 floor[i][i-x]=1;
29 }
30
31 for(i=1;i<=n;i++)
32 f[i]=floor[a][i];
33
34 f[a]=0;//初值是起点到每个点的距离！
35
36 for(i=1;i<=n;i++)
37 {
38 min=max;
39 for(j=1;j<=n;j++)
40 if(!used[j]&&f[j]<min)
41 {
42 min=f[j];k=j;
43 }
44
45 if(min==max)
46 break;
47 used[k]=1;
48
49 for(j=1;j<=n;j++)
50 if(!used[j]&&f[j]>floor[k][j]+f[k])
51 f[j]=floor[k][j]+f[k];
52 }
53
54 if(f[b]==max)
55 printf("-1\n");
56 else
57 printf("%d\n",f[b]);
58 }
59 return 0;
60 }