1.2.1 Elevator

Elevator

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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

Sample Output

--------

分析：一开始在0层，上升一层6s，下降一层4s，停的层等待5s

time=上升的楼层*6+下降的楼层*4+停顿次数*5

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

import java.util.Scanner;
public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc=new Scanner(System.in);
        while(sc.hasNext()){
            int n=sc.nextInt();
            if(n==0)break;
            int a[]=new int[n+1];
            int sumup=0;
            int sumdown=0;
            for(int i=1;i<=n;i++)
                {
                a[i]=sc.nextInt();
                if(a[i]>a[i-1]) sumup+=a[i]-a[i-1];
                  else sumdown+=a[i-1]-a[i];                
                }
            System.out.println(sumup*6+sumdown*4+n*5);
        
        }
        sc.close();

    }

}