# Elevator

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 60716    Accepted Submission(s): 33314

Problem Description
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
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.

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

Sample Input

1 2
3 2 3 1
0


Sample Output

17
41


Author
ZHENG, Jianqiang

Source

Recommend
JGShining   |   We have carefully selected several similar problems for you:   1005  1108  1061  1049  1013

Statistic |  Submit |  Discuss | Note

#include <stdio.h>
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
int sum=0;
int current=0;
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
if(x>current)
{
sum+=6*(x-current)+5;
}
else
{
sum+=4*(current-x)+5;
}
current=x;
}
printf("%d\n",sum);
}
return 0;
}

11-22 157
07-29 442

07-12 3430
12-15 432
08-11 1070
05-07 2332
01-19 2512
09-02 3388
03-18 2053
03-20 93
02-26 2266
12-29 388
01-01 44
04-16 2279
07-04 803
06-07 1万+
12-25 821