1008 Elevator

最新推荐文章于 2024-07-10 03:02:05 发布

Grayson Zhang

最新推荐文章于 2024-07-10 03:02:05 发布

阅读量72

点赞数 1

分类专栏： PAT

本文链接：https://blog.csdn.net/qq_51174011/article/details/113817960

版权

PAT 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

该博客主要涉及编程问题，内容是关于计算城市最高建筑中唯一电梯完成请求列表所花费的总时间。电梯上行每层耗时6秒，下行每层4秒，每站停留5秒。输入包含一个测试用例，包含一个正整数N和N个正整数，表示电梯停靠的楼层。程序通过计算得出总时间并输出。

摘要由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

解题

lst = list(map(int, input().split(' ')))
n = lst[0]
res = 5*n
def func(a, b):
    dif = b-a
    if dif > 0:
        return 6*dif
    else:
        return 4*abs(dif)
for i in range(1, n):
    res += func(lst[i], lst[i+1])
res += func(0, lst[1])
print(res)