PAT 1008（简单数学）

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

---

一、试题分析：

本题题目意思是： 

1. 上楼每层6s、下楼每层4s、到达则停5s
2. 输入第一个数为N
3. 后面继续输入N个数表示电梯到达的序列
4. 输出总共花费时间

二、解题思路：

本题求解只需要：每次到达楼层比较上一楼层，如果上升按照上升要求计算，下降按照下降要求计算即可。

#include<iostream>
using namespace std;

int main() {

	int n;
	int next;
	int now = 0;
	int sum = 0;
	cin >> n;
	for (int i = 0; i < n ; i++) {
		cin >> next;
		if (next - now > 0) //上楼
			sum += (next - now) * 6+5;
		else //下楼
			sum += (now - next) * 4+5;
		now = next;
	}
	cout << sum;
	return 0;
}