PAT 1008 Elevator python解法

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
この問題は最初は問題の意味がはっきりしていなかったが、最初の数はエレベーターが止まっている階の数で、後ろが要求シーケンスだった.エレベーターは最初は0階で、入力した3番目の数から直接判断することができます.前の数より大きいかどうか、大きいかどうかはx 6を減らします.そうしないと、x 4を減らします.毎回5秒滞在します.全部でnx 5秒滞在します.最初の数x 5です.もちろん、forサイクルで書くこともできます.違いはありません.

#l = [3, 2, 3, 1]
l = list(map(int,input().split()))
s = l[0]*5+l[1]*6
for i in range(2,len(l)):
    if l[i]>l[i-1]:
        s += (l[i]-l[i-1])*6
    else:
        s += (l[i-1]-l[i])*4
print(s)