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.
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
AC代码：
1 import java.util.Scanner; 2 3 public class Main{ 4 public static void main(String[] args) { 5 Scanner sc = new Scanner(System.in); 6 while (sc.hasNext()) { 7 int n = sc.nextInt(); // 输入要停留几个楼层 8 if (n == 0) 9 System.exit(0); 10 int a = 0; // 初始化楼层 11 int sum = 0; 12 for (int i = 0; i < n; i++) { 13 int b = sc.nextInt(); 14 if (b > a) { 15 sum += (b - a) * 6 + 5; 16 a = b; 17 } else { 18 sum += (a - b) * 4 + 5; 19 a = b; 20 } 21 } 22 System.out.println(sum); 23 } 24 } 25 }
