HDU ACM 1008

 

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		int STOP = 5;
		int UP = 6;
		int DOWN = 4;
		Scanner cin = new Scanner(System.in);
		int n = 0;
		List list = new ArrayList();
		while ((n = cin.nextInt()) != 0) {
			int nowFloor = 0;
			int sum = 0;
			for (int j = 0; j < n; j++) {

				int nextFloor = cin.nextInt();

				if (nextFloor > nowFloor) { // 如果是大于当前层的

					int jian = nextFloor - nowFloor; // 相差几层
					sum = sum + STOP + UP * jian;
					nowFloor = nextFloor;
					continue;
				}
				if (nextFloor < nowFloor) { // 如果下一次是小于当前层了
					int jian = nowFloor - nextFloor;
					sum = sum + STOP + DOWN * jian;
					nowFloor = nextFloor;
					continue;
				}
				if (nextFloor == nowFloor) { // 如果是相同的

					sum = sum + STOP;
					continue;

				}
			}// end for
			list.add(sum);
		} // end while

		for (int i = 0; i < list.size(); i++) {
			System.out.println(list.get(i));
		}
	} // end main

} // end class

 

 

 

（免费宾馆住宿 + 实习工资）阿里巴巴实习生招聘信息（仅限2013届本、硕毕业生）

Elevator

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20578    Accepted Submission(s): 11000

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