翻译2.7Elevator

原文链接：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.

一个给定数列最多由N个正数组成

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.

电梯上一层花费6s，下一层花费4s

The elevator will stay for 5 seconds at each stop.

电梯在每一层停止5s

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层 并且指令填完之后不会到负层

输入：

There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers.

有大量测试样例 每个样例包括一个整数N 之后跟着N个正数

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.

所有输入的数字都小于100 输入N=0时表示输入结束（这个不用处理）

输出：

Print the total time on a single line for each test case.

在每一行打印出每一个测试样例对应的花费时间

denote             表示