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:
41
这题的题意是让你依次完成列表中的电梯任务,如果当前楼层小于要去的楼层,就把time加上要去的楼层-当前楼层 *6再加上5s的停留时间,下楼层也是差不多
最后都要把当前楼层设为要去的楼层
#include<iostream>
using namespace std;
int main(){
int n, arr[101], now = 0, time = 0;
cin>>n;
for(int i = 0; i < n; i++){
cin>>arr[i];
}
for(int i = 0; i < n; i++){
if(arr[i] > now){
time += (arr[i]-now)*6+5;
}
else{
time += (now-arr[i])*4+5;
}
now = arr[i];
}
cout<<time;
}