PAT 1008 Elevator
目录
-
- 问题描述
- 思路分析及代码实现
问题描述
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
思路分析及代码实现
注意一个问题：不管输入的几，即便的输入两个相同的数，，也是要停留5秒的
n = int(input())
t = 0
sum = 0
for i in range(n):
a = int(input())
if a-t > 0:
sum += (a-t) * 6
else:
sum += (t-a) * 4
sum += 5
t = a
print(sum)
