1008Elevator (20)

最新推荐文章于 2021-08-18 12:42:21 发布

菜狗CaiDog

最新推荐文章于 2021-08-18 12:42:21 发布

阅读量231

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/BroKindey/article/details/81183929

本文深入探讨了一种电梯调度算法的实现细节，通过分析电梯上下楼层的时间成本，计算出完成一系列楼层请求所需的总时间。该算法考虑了电梯在不同楼层间的移动时间及在每层停留时间，为理解和优化电梯调度提供了有价值的参考。

摘要生成于 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.

输入描述:

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.

输出描述:

For each test case, print the total time on a single line.

输入例子:

3 2 3 1

输出例子:

#include <iostream>
using namespace std;

int main() {
int f = 0, pre_f = 0, time = 0;
int n;
cin >> n;
while (n) {
cin >> f;
if (f > pre_f) {
time += (f - pre_f) * 6;
}
else {
time += (pre_f - f) * 4;
}
time += 5;
pre_f = f;
n--;
}
cout << time;
return 0;
}