hdoj 1008 Elevator

Elevator

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

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<stdio.h>
int main()
{
	int n,m,j,i,l,t,sum;
	int a[110];
	while(scanf("%d",&n)&&n!=0)
	{
		m=0;sum=0;
		a[0]=0;
		for(i=1;i<=n;i++)
		{
		    scanf("%d",&a[i]);
		    if(a[i]>m)    //上楼的情况
		    {
		    	sum+=(a[i]-a[i-1])*6+5;
		    	m=a[i];
		    }
		    else if(a[i]<m)  //下楼的情况
		    {
		    	sum+=(m-a[i])*4+5;
		    	m=a[i];
		    }
		    else if(a[i]==m)  //在相同楼层的问题
		    {
		    	sum+=5;
		    	m=a[i];
		    }
		}
		printf("%d\n",sum);
	}
	return 0;
}