杭电1008 之 Elevator

最新推荐文章于 2022-09-26 21:30:58 发布

潮起汐落

最新推荐文章于 2022-09-26 21:30:58 发布

阅读量498

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/ESESZB/article/details/53956462

版权

水题专栏收录该内容

75 篇文章 0 订阅

订阅专栏

Elevator

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 68309 Accepted Submission(s): 37542

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

Sample Output

  
  
   
   17

   
   41
   
   

   
   分析：上一层电梯用时6秒，下一层电梯用时4秒，电梯将在每站停留5秒，给出站台的序列，求花费的总时间（从第0层开始）
   
   

   
   AC代码如下：
   
   #include <iostream>
#include <cstdio>
using namespace std;


int main()
{
    int n;
    int a[10000];
    while(cin>>n && n)
    {
        int ans=0;
        for(int i=0;i<n;i++) cin>>a[i];
        ans+=(a[0]-0)*6+5;
        for(int i=1;i<n;i++)
        {
            if(a[i]>a[i-1]) ans+=(a[i]-a[i-1])*6+5;
            else ans+=(a[i-1]-a[i])*4+5;
        }
        cout<<ans<<endl;
    }
    return 0;
}