HDU 1548 A strange lift（最短路或BFS）

A strange lift

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit   Status   Practice   HDU 1548

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

题意： 有一个奇怪有可爱的电梯，每层电梯有一个数字x，该电题在该层只能向上或向下移动x层  不能低于1层 小与总层数   问能到达输出最短次数 否则输出“-1”；
 AC代码  BFS篇

      
      
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
#define MAXN 210
int pace[MAXN],a[MAXN];
bool vis[MAXN];
int n ,m, l;
int f(int x)
{
    if(x<=n&&x>=1 && vis[x] == 0)
        return 1;
    return 0;
}
int bfs(int Bigen , int End)
{
    queue<int> Q;
    memset(vis,0,sizeof(vis));
    memset(pace,0,sizeof(pace));
    Q.push(Bigen);
    vis[Bigen]=1;
    while(!Q.empty())
    {
        int temp = Q.front();
        Q.pop();
        if(temp == End)
            return pace[End];
        if(f(temp+a[temp]))
        {
            Q.push(temp+a[temp]);
            vis[temp+a[temp]] = 1;
            pace[temp+a[temp]]=pace[temp]+1;
        }
        if(f(temp-a[temp]))
        {
            Q.push(temp-a[temp]);
            vis[temp-a[temp]] = 1;
            pace[temp-a[temp]]=pace[temp]+1;
        }
    }
    return -1;
}
int main()
{
    int i;
    while(cin >> n&&n)
    {
        memset(a,0,sizeof(a));
        cin >> m >> l;
        for(i=1; i<=n; i++)
            cin >> a[i];
        cout << bfs(m,l) << endl;
    }
    return 0;
}
      
      
AC 代码  最短 
      
         
      
      Dijkstra算法*/
      
      

      
      
#include<stdio.h>
#include<limits.h>
#include<string.h>
int a[210][210],dis[210],vis[210];
void dijkstra(int n,int pos)
{
    int i,j,min;
    memset(vis,0,sizeof(vis));
    vis[pos]=1;
    for(i=1;i<=n;i++)
        dis[i]=a[pos][i];
    dis[pos]=0;
    for(i=1;i<n;i++){
        min=INT_MAX;
        for(j=1;j<=n;j++)
            if(!vis[j]&&dis[j]<min){
                min=dis[j];
                pos=j;
            }
        vis[pos]=1;
        for(j=1;j<=n;j++)
            if(!vis[j]&&a[pos][j]!=INT_MAX&&dis[pos]+a[pos][j]<dis[j])
                dis[j]=dis[pos]+a[pos][j];
    }
}
int main()
{
    int n,i,j,l,r,c;
    while(scanf("%d",&n)!=EOF){
        if(n==0)
            break;
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++)
                a[i][j]=INT_MAX;
        }
        scanf("%d%d",&l,&r);
        for(i=1;i<=n;i++){
            scanf("%d",&c);
            if(i+c<=n)
                a[i][i+c]=1;
            if(i-c>=1)
                a[i][i-c]=1;
        }
        dijkstra(n,l);
        if(dis[r]==INT_MAX)
            dis[r]=-1;
        printf("%d\n",dis[r]);
    }
    return 0;
}