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
作者：CHEN, Yue
單位：浙江大學
代碼長度限制：16 KB
時間限制：400 ms
記憶體限制：64 MB
注意
- 這道題剛開始讀了半天感覺每咋弄懂，后來發現，它給的數字中，第一個數是需要停靠的次數，后面的才是想要電梯上的層數，
解題思路
- 新建一個陣列存盤數字，遍歷陣列，判斷上樓梯還是下樓梯，然后計算秒數，
Code
ls = list(map(int,input().split()))
res = ls[0]*5 + ls[1]*6
for i in range(2,len(ls)):
if ls[i] > ls[i-1]:
res += (ls[i] - ls[i-1]) * 6
else:
res += (ls[i-1] - ls[i]) * 4
print(res)
運行結果
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/260416.html
標籤：python
上一篇：微信讀書top100