zoukankan      html  css  js  c++  java
  • hdu1008

    Elevator

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

    Problem Description
    The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.
    For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.
     
    Input
    There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.
    Output
    Print the total time on a single line for each test case. 
    Sample Input
    1 2 3 2 3 1 0
     
    Sample Output
    17 41
     
     
     
    1. #include<iostream>
    2. #include<cstdio>
    3. using namespace std;
    4. int main()
    5. {  
    6. int to,i,n;
    7.  while(scanf("%d",&n),n)
    8.  {  
    9.  int time=0,from=0;  
    10.  for(i=0;i<n;i++)
    11.  {    
    12. scanf("%d",&to);
    13.    if((to-from)>0)  
    14.    time+=(to-from)*6+5;  
    15.   else     
    16. time+=(from-to)*4+5;  
    17.   from=to;  
    18.  }   
    19. printf("%d\n",time);  
    20. }  
    21. return 0;
    22. }
  • 相关阅读:
    [每日一题]石子合并 -- 区间DP
    [每日一题]: 最长上升子序列 AND 最长不上升子序列
    [每日一题]:最大子矩阵和
    入门DP--最大子段和
    [转载]:正确的提问方式
    springmvc.xml
    service层springservice.xml文件
    aop切面配置
    配置事务通知
    短信验证
  • 原文地址:https://www.cnblogs.com/Deng1185246160/p/2941116.html
Copyright © 2011-2022 走看看