PAT 甲级 1008 Elevator

PAT 甲级 1008 Elevator

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 Specification:

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.

Output Specification:

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

Sample Input:

3 2 3 1
结尾无空行

Sample Output:

41
结尾无空行

题意描述：

有一个电梯，按顺序给出N个楼层，给出电梯每上升一层的时间、每下降一层的时间以及在N个楼层停留的时间，统计花费总时间。

解题思路：

纯模拟题。比较当前楼层与前一楼层的上下关系，然后统计上升的总楼层数以及下降的总楼层数，最后按照题意计算即可。

难度评测：Easy

AC代码实现：

#include <bits/stdc++.h>
using namespace std;
int a[105];

int main() {
	int n, up, down;
	cin >> n;
	up = down = 0;
	a[0] = 0;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		if(a[i] > a[i - 1])
			up += a[i] - a[i - 1];
		else
			down += a[i - 1] - a[i];
	}
	int tot = up * 6 + down * 4 + 5 * n;
	cout << tot;
}