zoukankan      html  css  js  c++  java
  • hdu 1548 人生的第一道宽搜题

    http://acm.hdu.edu.cn/showproblem.php?pid=1548

    第一道宽搜题,虽然参考了代码,但感觉不是太难

    马上就能运用自如,耶!        I CAN!!

    A strange lift

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 9235    Accepted Submission(s): 3506


    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
     
    #include <stdio.h>
    #include <string.h>
    #include <queue>
    using namespace std;
    struct Node
    {
         int src;
         int num;
    };
    int A,B,N;
    int data[260],flag[260];
    int BFS()
    {
          queue<Node> q;
          int up,down;
          Node temp,t;
          flag[A]=1;
          t.num=0;
          t.src=A;
          q.push(t);
          while(!q.empty())
          {
                temp=q.front();
                q.pop();
                if(temp.src==B)return temp.num;
                up=temp.src+data[temp.src];
                if(up<=N&&flag[up]==0)
                {
                      flag[up]=1;
                      t.num=temp.num+1;
                      t.src=up;
                      q.push(t);
                }
                down=temp.src-data[temp.src];
                if(down>0&&flag[down]==0)
                {
                      flag[down]=1;
                      t.num=temp.num+1;
                      t.src=down;
                      q.push(t);
                }
    
          }
     return -1;
    }
    
    int main()
    {
          int n,m,i,j;
          while(scanf("%d",&N)!=EOF&&N!=0)
          {
                memset(flag,0,sizeof(flag));
                scanf("%d%d",&A,&B);
                for(i=1;i<=N;i++)
                scanf("%d",&data[i]);
                printf("%d
    ",BFS());
    
          }
    }
  • 相关阅读:
    jQuery ajax中支持的数据类型
    行内元素与块级元素
    本地连接无法加载远程访问连接管理器服务,错误711
    SQL Server 两种判断表名是否存在且删除的方式
    SQL Server 2008 修改表名
    MySql5.1在Win7下的安装与重装问题的解决
    JavaScript关闭浏览器
    SQL Server 添加一条数据获取自动增长列的几种方法
    获取当前程序运行目录
    字符串的判断与替换
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3422081.html
Copyright © 2011-2022 走看看