【杭电-oj】-1008-Elevator（电梯）_there are multiple test cases. each case contains -CSDN博客

本文链接：https://blog.csdn.net/Bear1998/article/details/50988448

本文深入探讨了信息技术领域的核心技术，包括但不限于前端开发、后端开发、移动开发等细分技术领域，详细介绍了各领域的关键概念、工具及应用实例，旨在为读者提供全面的技术洞察。

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

Problem Description

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

There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.

Output

Print the total time on a single line for each test case.

Sample Input

1 2
3 2 3 1
0

Sample Output

17
41

#include<stdio.h>
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        int y=0;
        int a[111];
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        
        for(int i=1;i<=n;i++)
        {
            a[0]=0; 
            if(a[i]>a[i-1])
            {
                y=y+6*(a[i]-a[i-1])+5;
            }
            else
            {
                y=y+4*(a[i-1]-a[i])+5;
            }
        }
        printf("%d\n",y);
    }
    return 0;
}

Problem Description

Input

Output

Print the total time on a single line for each test case.

Sample Input