1008 Elevator (20 分)

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

结尾无空行

挺简单的，毕竟是 20 分的题目，最开始记录一个 now 为当前位置，如果输入数组是上升，就乘以 6，如果是下降，就乘以 4，最后再加上每层等待的时间 5 秒，就是最后的答案。

#include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<deque>
#include<cctype>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<cstring>
using namespace std;
int main() {
	int n;
	cin >> n;
	int now = 0;
	int total = 0;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (x - now > 0) {
			total += (x - now) * 6;
		} else {
			total += (now - x) * 4;
		}
		now = x;
	}
	total += n * 5;
	cout << total;
	return 0;
}