/*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*/
#include <stdio.h>
#define N 5
int main()
{
int a[N][N],i = 0,j = 0,n = 1,sum,b;
char c;
scanf("%d",&a[i][0]);
while(a[i][0] != 0)
{
n = 1;
for(j = 1;j < N;j++)
{
scanf("%d",&a[i][j]);
n++;
c = getchar();
if(c == '\n')
{
sum = 0;
b = 0;
for(j = 0;j < n;j++)
{
if((a[i][j] - b) > 0)
{
sum = sum + (a[i][j] - b) * 6;
b = a[i][j];
}
else if((a[i][j] - b) < 0)
{
sum = sum + (b - a[i][j]) * 4;
b = a[i][j];
}
}
a[i][0] = sum + 5;
break;
}
}
i++;
scanf("%d",&a[i][0]);
}
for(j = 0;j < i;j++)
{
printf("%d\n",a[j][0]);
}
}
害,能加括号就加括号