1008 Elevator (20分)

最新推荐文章于 2022-02-10 21:00:30 发布

牧心.

最新推荐文章于 2022-02-10 21:00:30 发布

阅读量3.2w

点赞数 2

CC 4.0 BY-SA版权

分类专栏： # PAT Advanced Level Practice PTA

本文链接：https://blog.csdn.net/Aibiabcheng/article/details/104708644

PTA 同时被 2 个专栏收录

176 篇文章

订阅专栏

PAT Advanced Level Practice

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 <bits/stdc++.h>

using namespace std;

int a[1000];

int main() {
    long long ans = 0;
    int n;
    scanf("%d", &n);
    a[0] = 0;
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++) {
        if (a[i] < a[i-1])
            ans += (a[i-1] - a[i]) * 4 + 5;
        else
            ans += (a[i] - a[i-1]) * 6 + 5;
    }
    printf("%lld", ans);
    return 0;
}