pat 甲级 A1008 Elevator

1008 Elevator

分数 20

全屏浏览题目

切换布局

作者 CHEN, Yue

单位 浙江大学

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

题意：样例第一个数为要去的楼层个数，后面数是要去的顺序，上楼的话上一层要6秒，下楼下一层要4秒，不管是上楼还是下楼电梯都要在这个楼层等5秒；

思路：用to代表要去的楼层，now代表现在的楼层，to比now大就是上楼，比now小就是下楼，不管上楼还是下楼都要等5秒，从而得出总时间；

代码：

#include<iostream>
using namespace std;
int main(){
	int n,to,now=0,cost=0;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>to;
		to>now?cost+=(to-now)*6:cost+=(now-to)*4;
		cost+=5;
		now=to;
	}
	cout<<cost;
}