链接:https://acs.jxnu.edu.cn/problem/HDU1008
题目:
描述:
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.输入:
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.
输出:
Print the total time on a single line for each test case.
翻译如下
描述:
我们超市最高的建筑只有一台电梯。在电梯里有N个按钮,当按下一个按钮时,电梯会在其指定的楼层停下。电梯上升一层需要6秒,下降一层需要4秒。电梯在每层的停留时间为5秒。给出按钮的按下顺序,你要计算出电梯总共花费的时间。电梯的初始位置为0楼,当完成给出的顺序时,电梯不需要回到初始位置。
输入:
输入包含多组样例。每一组样例包含一个整数N,表示将再输入N个整数。这N个整数表示电梯里按钮按下的顺序。所有的数字均小于100。当输入的N为0时,终止输入。
输出:
对于每组样例,输出所需花费的时间。