zoukankan      html  css  js  c++  java
  • 【BFS】【HDOJ-1548】A strange lift

    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"?
     
    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
     
    思路:
    简单BFS 分两个方向就行了
     
     
    参考代码:
     1 #include <stdio.h>
     2 #include <string.h>
     3 int map[210];
     4 int bfs(int a,int b);
     5 int queue[10000];
     6 int mark[10000];
     7 int step[10000];
     8 int n;
     9 int main()
    10 {
    11     int a,b;
    12     while(scanf("%d",&n)&&n)
    13     {
    14         memset(map,0,sizeof(map));
    15         memset(mark,0,sizeof(mark));
    16         memset(step,0,sizeof(step));
    17         scanf("%d%d",&a,&b);
    18         int i;
    19         for(i=1;i<=n;i++)
    20             scanf("%d",&map[i]);
    21         if(a==b)
    22         {
    23             printf("0
    ");
    24             continue;
    25         }
    26         int ans=bfs(a,b);
    27         if(ans)
    28             printf("%d
    ",ans);
    29         else
    30             printf("-1
    ");
    31     }
    32     return 0;
    33 }
    34 
    35 int bfs(int a,int b)
    36 {
    37     queue[1]=a;
    38     mark[queue[1]]=1;
    39     int front=1,rear=2;
    40     int k=a;
    41     while(front<rear)
    42     {
    43         k=queue[front];
    44         if(k+map[k]<=n&&!mark[k+map[k]])
    45         {
    46             int newl=k+map[k];
    47             queue[rear++]=newl;
    48             mark[newl]=1;
    49             step[newl]=step[queue[front]]+1;
    50             if(newl==b)
    51                 return  step[newl];
    52         }
    53         if(k-map[k]>=1&&!mark[k-map[k]])
    54         {
    55             int newl=k-map[k];
    56             queue[rear++]=newl;
    57             mark[newl]=1;
    58             step[newl]=step[queue[front]]+1;
    59             if(newl==b)
    60                 return step[newl];
    61         }
    62         front++;
    63     }
    64     return 0;
    65 }
  • 相关阅读:
    Android SDK Platforms
    Maven实战(五)坐标详解
    JSTL 核心标签库 使用
    在eclipse上安装Aptana插件
    jquery replace字符串全部替换
    Oracle笔记(四) 简单查询、限定查询、数据的排序
    Oracle笔记(三) Scott用户的表结构
    Oracle笔记(二) SQLPlus命令
    Oracle笔记(一) Oracle简介及安装
    Oracle笔记(六) 多表查询
  • 原文地址:https://www.cnblogs.com/ahu-shu/p/3521528.html
Copyright © 2011-2022 走看看