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
解题思路
本题好像非常简单吧,上升 加6 s 下降 加 4s 加上器中的 间隔 5 s 输出总的时间即可,其实第一 个数是而可以忽略的,直接计算目标要到达的电梯数就行了,所以需要将第一个数过滤掉,别把它当成,目标的电梯数就行。
解题代码
#include <iostream>
using namespace std;
int main(){
int cur = 0, temp, totsec = 0;
while(cin >> temp){
if(cur < temp){
totsec += (temp - cur) * 6;
}else{
totsec += (cur - temp) * 4;
}
totsec += 5;
cur = temp;
}
cout << totsec;
return 0;
}