• pat 1008 Elevator(20 分)


    1008 Elevator(20 分)

    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 Specification:

    Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.

    Output Specification:

    For each test case, print the total time on a single line.

    Sample Input:

    3 2 3 1
    

    Sample Output:

    41
    
     
     
     1 #include <map>
     2 #include <set>
     3 #include <queue>
     4 #include <cmath>
     5 #include <stack>
     6 #include <vector>
     7 #include <string>
     8 #include <cstdio>
     9 #include <cstring>
    10 #include <climits>
    11 #include <iostream>
    12 #include <algorithm>
    13 #define wzf ((1 + sqrt(5.0)) / 2.0)
    14 #define INF 0x3f3f3f3f
    15 #define LL long long
    16 using namespace std;
    17 
    18 const int MAXN = 1e6 + 10;
    19 
    20 LL A[MAXN] = {0}, n, ans = 0;
    21 
    22 int main()
    23 {
    24     scanf("%lld", &n);
    25     for (LL i = 1; i <= n; ++ i)
    26         scanf("%lld", &A[i]);
    27     ans += n * 5;
    28     for (LL i = 1; i <= n; ++ i)
    29         if (A[i - 1] <= A[i])
    30             ans += (A[i] - A[i - 1]) * 6;
    31         else
    32             ans += (A[i - 1] - A[i]) * 4;
    33     printf("%lld
    ", ans);
    34     return 0;
    35 }
  • 相关阅读:
    commons
    Dozer数据对象转换神器
    xstream
    javassist
    JAVA设计模式之单例模式
    单例模式
    OC_自动引用计数器_0x04
    OC_自动引用计数器_0x03
    OC_自动引用计数器_0x02
    OC_自动引用计数器_0x01
  • 原文地址:https://www.cnblogs.com/GetcharZp/p/9577740.html
Copyright © 2020-2023  润新知