1008. Elevator (20)[C语言]

最新推荐文章于 2024-08-24 19:00:00 发布

原创最新推荐文章于 2024-08-24 19:00:00 发布 · 556 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #c语言

PAT算法练习专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一个关于电梯在特定楼层请求列表下移动的时间计算问题。电梯从0楼开始，按照输入的楼层请求顺序移动，每上一层花费6秒，下一层花费4秒，并在每一站停留5秒。文章提供了一段C语言代码实现，用于计算完成所有楼层请求所需的总时间。

1008. Elevator (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

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:

#include <stdio.h>
#include <stdlib.h>

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