【PAT】A1008 Elevator（20）（数学问题）

最新推荐文章于 2021-09-15 14:14:32 发布

河豚消气

最新推荐文章于 2021-09-15 14:14:32 发布

阅读量132

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/weixin_51642508/article/details/119777090

版权

该博客讨论了一个数学问题，涉及电梯在城市最高楼的运行时间计算。给定电梯停靠楼层的请求列表，根据上行和下行所需时间及停留时间，计算完成所有请求的总时间。题目提供了一个样例输入和输出，并提出了相应的解决方案。

摘要由CSDN通过智能技术生成

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</