PAT TEST甲级1008. Elevator (20)

最新推荐文章于 2021-01-25 13:16:16 发布

原创最新推荐文章于 2021-01-25 13:16:16 发布 · 328 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个简单的电梯调度问题，通过给定楼层请求列表，计算电梯完成所有请求所需的总时间。电梯从0楼出发，向上移动每层花费6秒，向下移动每层花费4秒，并在每个停靠层停留5秒。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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:

注意点：操作是按顺序，一开始还在考虑是否需要排序在按大小操作，按例子计算了一下发现直接按输入的顺序操作即可。

#include
#include
using namespace std;

int main()
{
	int n,i,t;
	cin>>n;
	int e[n];
	for(i=0;i>e[i];
	}
	t=e[0]*6+5;
	for(i=1;ie[i-1])
		{
			t=t+(e[i]-e[i-1])*6+5;
		}else{
			t=t+(e[i-1]-e[i])*4+5;
		}
	}
	cout<