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.

---

• 输入格式：
  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.

• 输出格式：
  For each test case, print the total time on a single line.

---

解题方法：
这道题就是简单的计算问题，没有任何难度

---

程序：

#include <stdio.h>

int main(int argc, char const *argv[])
{
    int sum = 0, N, level = 0, input;
    scanf("%d", &N);
    sum += N*5;
    for (int i = 0; i < N; i++)
    {
        scanf("%d", &input);
        if (input > level)
            sum += (input-level) * 6;
        else
            sum += (level-input) * 4;
        level = input;
    }
    printf("%d\n", sum);
    return 0;
}

如果对您有帮助，帮忙点个小拇指呗~