zoukankan      html  css  js  c++  java
  • 杭电 1548 A strange lift(广搜)

    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): 11341    Accepted Submission(s): 4289


    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
     AC代码:

    <span style="font-size:24px;">#include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    #include<queue>
    using namespace std;
     
    const int maxn = 201;
    int n, a, b;
    int kp[maxn];
    bool mark[maxn];
    struct Node {
        int floor;
        int tme;
    };
     
    int BFS() {
        memset(mark, false, sizeof(mark));
        queue<Node> Q;
        Node first, next_up, next_down;
        first.tme = 0;
        first.floor = a;
        Q.push(first);
        mark[a] = true;  //标记
     
        while (!Q.empty()) {
            first = Q.front();
            Q.pop();
     
            if (first.floor == b) {
                return first.tme;
            }
            next_up.floor = first.floor + kp[first.floor];
            if (next_up.floor <= n && !mark[next_up.floor ]) {
                next_up.tme = first.tme + 1;
                mark[next_up.floor] = true;
                Q.push(next_up);
            }
            next_down.floor = first.floor - kp[first.floor];
            if (next_down.floor >= 1 && !mark[next_down.floor]) {
                next_down.tme = first.tme + 1;
                mark[next_down.floor] = true;
                Q.push(next_down);
            }
        }
        return -1;
    }  
     
    int main() {
     
        while (~scanf("%d", &n), n ) {
            scanf("%d%d", &a, &b);
            for (int i = 1; i <= n; i++) {
                scanf("%d", &kp[i]);
            }                         //输入
            int res = BFS();
            printf("%d
    ", res);
        }
    }</span>



  • 相关阅读:
    存储过程加密
    sql 指删除表,改表名,改字段名
    windows 2003 server 64 位 IIS 6下部署 32位网站
    linux查看内存的使用占比
    linux查看端口是否被占用
    ERROR 2002 (HY000): Can't connect to local MySQL server through socket ‘/var/lib/mysql/mysql.sock' (2)
    mysql数据库的备份(mysqldump)和恢复(source)
    linux解压压缩文件zip/tar/tar.gz命令汇总
    oracle数据库的备份和导入数据
    oracle 备份表数据
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/4050498.html
Copyright © 2011-2022 走看看