zoukankan      html  css  js  c++  java
  • HDU1008 Elevator

    题目链接

    Elevator

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


     

    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

    这题太水了我都不好意思了(*/ω\*)

    AC代码:

     1 #include<iostream>
     2 #include<algorithm>
     3 #include<string>
     4 #include<iomanip>
     5 #include<vector>
     6 #include<cmath>
     7 #include<stack>
     8 using namespace std;
     9 int main()
    10 {
    11     int N;
    12     while(cin>>N,N!=0)
    13     {
    14         int ans=0,now=0,bef=0;
    15         for(int i=1;i<=N;i++)
    16         {
    17             cin>>now;//当前楼层 
    18             if(now>bef) ans+=6*(now-bef);
    19             else if(now<bef) ans+=4*(bef-now);
    20             ans+=5;
    21             bef=now;//上次楼层 
    22         }
    23         cout<<ans<<endl; 
    24     }
    25 }
    View Code
  • 相关阅读:
    MongoDB 生态 – 可视化管理工具
    SOLR对多个(关联)表创建索引
    sublime 插件zen coding
    12/12工作笔记
    阅读《深入理解JavaScript定时机制》
    继续谈论XSS
    支付宝快捷支付模型
    谈论XSS
    生产者消费者模型
    如何根据iframe内嵌页面调整iframe高宽续篇
  • 原文地址:https://www.cnblogs.com/wangzhebufangqi/p/12796191.html
Copyright © 2011-2022 走看看