HZDU 1008 Elevator

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

ZJCPC2004 

中文简易翻译：

题目描述

某城市最高的建筑只有一部电梯。一份电梯升降任务表由N个正整数组成，这些数字表示电梯按照给定的顺序停留的楼层号。
电梯升一层花费6秒钟，降一层花费4秒钟，并且每次停留花费5秒钟。
对于每一份任务表，你要计算出完成全部升降任务所花费的总时间。一开始，电梯在第0层，并且最终完成任务时电梯不必一定返回到0层。

输入描述

有多组测试样例。每组测试样例包含一个正整数N，接下来是N个正整数。
在输入中，所有的数字都小于100。当N=0时，表示输入结束。

输出描述

对于每一组测试样例，在一行中输出总时间。

输入样例

1 2
3 2 3 1
0

输出样例

17
41

提示

AC代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;

int main()
{
    int N,floor,a,sum;
    while(scanf("%d",&N)!=EOF&&N)
    {
    sum=5*N;
    floor=0;
    while(N--)
    {
        
        scanf("%d",&a);
        if(a>floor)
            sum=sum+6*(a-floor);
        if(a<floor)
            sum+=4*(floor-a);
        floor=a;
    }
    printf("%d\n",sum);
   }
    return 0;
}