HDU ACM 1008 Elevator

Problem Description

The highest building in our city has only one elevator. A requestlist is made up with N positive numbers. The numbers denote atwhich floors the elevator will stop, in specified order. It costs 6seconds to move the elevator up one floor, and 4 seconds to movedown one floor. The elevator will stay for 5 seconds at eachstop.

For a given request list, you are to compute the total time spentto fulfill the requests on the list. The elevator is on the 0thfloor at the beginning and does not have to return to the groundfloor when the requests are fulfilled.

 

Input

There are multiple test cases. Each case contains a positiveinteger N, followed by N positive numbers. All the numbers in theinput are less than 100. A test case with N = 0 denotes the end ofinput. This test case is not to be processed.

 

Output

Print the total time on a single line for each testcase. 

 

Sample Input

1 2 32 3 1 0

 

Sample Output

1741

 

Java Code:

import java.util.Scanner;
public class P1008 {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		while (s.hasNext()) {
			int n = s.nextInt();
			if (n == 0) {
				return;
			}
			int time = 0;
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = s.nextInt();
			}
			if (n != 1) {
				time += arr[0] * 6 + 5;// 17
				for (int i = 0; i < n - 2; i++) {
					if (arr[i + 1] > arr[i]) {
						time += (arr[i + 1] - arr[i]) * 6 + 5;// 28
					} else {
						time += (arr[i] - arr[i + 1]) * 4 + 5;
					}
				}
				if (arr[n - 1] < arr[n - 2]) {
					time += (arr[n - 2] - arr[n - 1]) * 4 + 5;
				} else {
					time += (arr[n - 1] - arr[n - 2]) * 6 + 5;
				}
			} else {
				time = arr[0] * 6 + 5;
			}
			System.out.println(time);
		}
	}
}