PAT 1008 Elevator python解法

最新推荐文章于 2025-05-31 16:10:35 发布

D_ry

最新推荐文章于 2025-05-31 16:10:35 发布

阅读量404

点赞数

分类专栏： python 用Python刷PAT (Advanced Level) Practice

本文链接：https://blog.csdn.net/qq_36936510/article/details/85267117

版权

这道编程题是关于城市中最高建筑的电梯操作。给定一个包含N个正整数的请求列表，表示电梯在各楼层的停靠顺序。上一层耗时6秒，下一层耗时4秒，每停靠一次额外等待5秒。电梯最初位于0层，并且完成请求后不必返回地面。题目要求计算完成所有请求所需的时间。输入包含一个测试用例，输出总的耗时。例如，对于输入`3 2 3 1`，输出应为`41`秒。解决方案是从输入的第3个数开始判断，根据楼层变化计算电梯移动和停留时间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

这道题最开始没注意看清题意，