STD 1009 Elevator

最新推荐文章于 2020-01-21 16:57:23 发布

原创最新推荐文章于 2020-01-21 16:57:23 发布 · 430 阅读

0 ·

CC 4.0 BY-SA版权

STUD 专栏收录该内容

6 篇文章

订阅专栏

Elevator

Time Limit: 1000ms Memory limit: 32768K 有疑问？点这里^_^

题目描述

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.

输入

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.

输出

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

示例输入

1 2
3 2 3 1
0

示例输出

17
41

提示

来源

示例程序

#include<stdio.h>  
int main()  
{  
    int i,j,n,m,a[100],b,c;  
    while(scanf("%d",&n)&&n)  
    {  
        m=0;  
        b=0;  
        c=0;  
        for(i=0;i<n;i++)  
        {  
            scanf("%d",&a[i]);  
            if(a[i]-b>0)  
                c+=(a[i]-b)*6;  
            else  
                c+=(b-a[i])*4;  
            c+=5;  
            b=a[i];  
        }  
        printf("%d\n",c);  
    }  
}