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:
41Elevator
电梯
request list
请求列表
denote
表示，标志
in specified order
按指定顺序
翻译：
在我们的城市里，最高的建筑物里只有一部电梯。有一份由N个正数组成的请求列表。这些数表示电梯将会以规定的顺序在哪些楼层停下。电梯升高一层需要6秒，下降一层需要4秒。每次停下电梯将花费5秒。
给你一个请求列表，你需要计算出完成列表里的请求总共花费的时间。一开始电梯在0层。当请求全部完成时，电梯不需要回到底层。
#include<bits/stdc++.h>
#pragma GCC optimize(3)
#define max(a,b) a>b?a:b
using namespace std;
typedef long long ll;
int a[105];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
int x=0;
ll ans=0;
for(int i=1;i<=n;i++){
if(a[i]>x) ans+=(a[i]-x)*6+5;
else if(a[i]<x) ans+=(x-a[i])*4+5;
else ans+=5;
x=a[i];
}
cout<<ans<<endl;
return 0;
}
