题目描述
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
题目总结
这道题目比较简单,故简单说一下题目的要求:
1.给定电梯在每层楼的停留时间,上升一层楼的时间和下降一层楼的时间,初始状态停留在一楼
2.输入电梯停留的楼层数,计算总共花费的时间
因为题目比较简单,所以直接给出全部代码
#include<stdio.h>
#include<algorithm>
using namespace std;
int stop_floor[1000], stop_time = 5, up_time = 6, down_time = 4, init_floor = 0;
int main(){
int n, total_time = 0;
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d", &stop_floor[i]);
if(i == 0) total_time += up_time * (stop_floor[i] -init_floor);
else if(stop_floor[i] > stop_floor[i-1]){
total_time += up_time * (stop_floor[i] - stop_floor[i-1]);
}
else{
total_time += down_time * (stop_floor[i-1] - stop_floor[i]);
}
}
total_time += n * stop_time;
printf("%d", total_time);
return 0;
}