T - Elevator

题目如下：

         The highest building in our city has only one elevator. Arequest list is made up with N positive numbers. The numbers denote at whichfloors the elevator will stop, in specified order. It costs 6 seconds to movethe elevator up one floor, and 4 seconds to move down one floor. The elevatorwill stay for 5 seconds at each stop. 

        For a given request list, you are to compute the total time spent to fulfillthe requests on the list. The elevator is on the 0th floor at the beginning anddoes not have to return to the ground floor when the requests are fulfilled. 

---------------------------------------------------------------------------------------------------------------

输入如下：

                 There are multiple test cases. Each case contains apositive integer N, followed by N positive numbers. All the numbers in theinput are less than 100. A test case with N = 0 denotes the end of input. Thistest case is not to be processed. 

---------------------------------------------------------------------------------------------------------------

输出如下：

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

---------------------------------------------------------------------------------------------------------------

测试用例输入如下：

1 2

3 2 3 1

0

---------------------------------------------------------------------------------------------------------------

测试用例输出如下：

17

41

 ---------------------------------------------------------------------------------------------------------------

电梯就是我们平时的电梯，不要和之前的一种蜗牛爬井口的题型混淆区做。电梯是到了目标地点之后停下来，那一种题型就是上一次，就会滑下去一次，直到到达目标地点之后，才不会滑下去。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int main()
{
	int n;
	int a[100];
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0) break;
	   memset(a,0,sizeof(a));
	   a[0] = 0;
	   for(int i=1;i<=n;i++)
	   {
	   	  scanf("%d",&a[i]);
	   }
	   int time = 0;
	   for(int i=1;i<=n;i++)
	   {
	   	 if(a[i]-a[i-1]>0)
		 {
	   	 	time +=(a[i]-a[i-1])*6+5;
	   	 }
		else
		{
			time +=(a[i-1]-a[i])*4+5;
		}
	   }
	    printf("%d\n",time); 
	}
	return 0;
}

 ---------------------------------------------------------------------------------------------------------------