zoukankan      html  css  js  c++  java
  • PAT (Advanced Level) Practise:1008. Elevator

    【题目链接】

    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 <stdio.h>
     2 
     3 int main(void)
     4 {
     5     int N;
     6     int i, pre, cur;
     7     int delta;
     8     int time;
     9 
    10     pre = 0;
    11     time = 0;
    12     scanf("%d", &N);
    13     for(i = 0; i < N; i++)
    14     {
    15         scanf("%d", &cur);
    16         if(cur - pre >= 0)
    17         {
    18             delta = cur - pre;
    19             time += (delta * 6);
    20         }
    21         else
    22         {
    23             delta = pre - cur;
    24             time += (delta * 4);
    25         }
    26         pre = cur;
    27     }
    28     printf("%d", time + N * 5);
    29 
    30     return 0;
    31 }

    运行结果:

  • 相关阅读:
    201621123059《Java程序设计》第二周学习总结
    学习计划表
    201621123059《java程序设计》第一周学习总结
    C语言I作业06
    C语言I博客作业05
    C语言I博客作业04
    志勇的C语言I博客作业03
    志勇的C语言I博客作业02
    志勇的第一周作业
    pdf文件完美转换技巧分享
  • 原文地址:https://www.cnblogs.com/utank/p/4775167.html
Copyright © 2011-2022 走看看