1008 Elevator

最新推荐文章于 2024-08-01 09:03:54 发布

F=k·Δx

最新推荐文章于 2024-08-01 09:03:54 发布

阅读量180

点赞数 1

分类专栏： Python

本文链接：https://blog.csdn.net/Outsider_ahhdd/article/details/113816447

版权

电梯算法时间复杂度数学建模编程正整数处理

关键词由CSDN通过智能技术生成

Python 专栏收录该内容

158 篇文章 3 订阅

订阅专栏

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.(我们城市最高的建筑只有一部电梯。请求列表由N正数。数字表示电梯将按指定顺序在哪个楼层停止。将电梯向上移动一层需要 6 秒，向下移动一层需要 4 秒。电梯将在每个站停留5秒钟。)

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.(对于给定的请求列表，要计算完成列表中请求所花费的总时间。电梯在0楼开始时，在满足要求时不必返回一楼。)

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.(每个输入文件包含一个测试用例。每个案例都包含一个正整数N其次N正数。输入中的所有数字都小于 100。)

Output Specification:
For each test case, print the total time on a single line.(对于每个测试用例，在一行上打印总时间。)

Sample Input:
3 2 3 1
Sample Output:
41

n = input().split()
list1 = list(map(int, n))
output = list1[0]*5 + list1[1]*6
for i in range(2, len(list1)):
    if list1[i] > list1[i - 1]:
        output += (list1[i] - list1[i-1]) * 6
    if list1[i] < list1[i - 1]:
        output += (list1[i-1] - list1[i]) * 4
print(output)