PAT A1008 Elevator (20 分)

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

分析：

用一个指针currfloor表示当先所在楼层，初始为0, 每次读入目标楼层floor之后与当前楼层比较:

floor大于currfloor,表示上楼，时间(floor-currfloor)*6+5

floor小于currfloor,表示下楼，时间(currfloor-floor)*4+5

floor等于currfloor,表示不变，但也要计算停留时间5s

第一次提交没考虑到等于的情况，有些测试点没通过。

启示：题干并没有说不存在楼层不变的情况，边界情况要考虑充分。

通过代码：

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	cin>>n;
	int time = 0;
	int currfloor = 0;
	for(int i=0;i<n;i++){
		int floor;
		cin>>floor;
		if(floor > currfloor){
			time = time + (floor - currfloor)*6+5;
		}
		else if(floor < currfloor){
			time = time + (currfloor - floor)*4 + 5;
		}
		else{
			time += 5; 
		} 
		currfloor = floor;

	}
	cout<<time<<endl; 
	

	return 0;
}