acm1008用java_杭电acm1008 Elevator

Elevator

Time Limit: 2000/1000 MS

(Java/Others) Memory

Limit: 65536/32768 K (Java/Others)

Total Submission(s):

14982 Accepted

Submission(s): 7819

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

#include

int main()

{

int t0,t,N,sum,k;

while(scanf("%d",&N)!=EOF&&N!=0)

{

t0=0;sum=0;k=0;

while(N--)

{

scanf("%d",&t);

if(t>t0)

sum+=(t-t0)*6;

else

sum+=(t0-t)*4;

t0=t;

k++;

}

sum+=k*5;

printf("%d\n",sum);

}

return 0;

}