PAT习题：Elevator (20)

小编准备考PAT甲级的证，因此开始刷题中。将刷过的题及自己所编的代码进行整理分享。

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.

输入描述:

Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.

输出描述:

For each test case, print the total time on a single line.

示例1
输入

3 2 3 1

输出

41

代码：

package Match;

import java.util.List;
import java.util.Scanner;
import java.util.Vector;

/**
 * Elevator (20)
 * 
 * @version 1.0
 * @author Liu
 */
public class Match1008 {

	public static void main(String[] args) {
		List<Integer> list = new Vector<Integer>();
		Scanner scanner = new Scanner(System.in);
		int upTime = 6, downTime = 4, stayTime = 5;
		int total = 0;
		int num = scanner.nextInt();
		for (int i = 0; i < num; i++) {
			list.add(scanner.nextInt());
		}

		total += list.get(0) * upTime + stayTime;
		for (int i = 1; i < list.size(); i++) {
			if (list.get(i) - list.get(i - 1) > 0) {
				total += (list.get(i) - list.get(i - 1)) * upTime;
			} else {
				total += (list.get(i - 1) - list.get(i)) * downTime;
			}
			total += stayTime;
		}
		System.out.println(total);

	}

}

解题思路：
这道题比较简单，就不详细解释解题思路了。