原题
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
题目翻译
我们城市最高的大楼只有一部电梯。请求列表由 N 个正数组成。这些数字表示电梯将按指定顺序停在哪一层。电梯上行一层需要 6 秒,下行一层需要 4 秒。电梯在每个停靠点停留 5 秒。
对于给定的请求列表,你需要计算完成列表上的请求所花费的总时间。电梯在开始时位于 0 楼,完成请求后无需返回底楼。
输入规范:
每个输入文件包含一个测试用例。每个案例包含一个正整数 N,后面跟 N 个正数。输入中的所有数字都小于 100。
输出规范:
对于每个测试用例,在一行中打印总时间。
解题思路
简单题,直接求就行了。
代码(c++)
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n;
int f[N];
int main(){
cin >> n;
for(int i = 1; i <= n; i++) cin >> f[i];
int ans = 0;
for(int i = 1; i <= n; i++) {
if(f[i] - f[i - 1] > 0) ans = ans + (f[i] - f[i - 1]) * 6 + 5;
else ans = ans + (f[i - 1] - f[i]) * 4 + 5;
}
cout << ans << endl;
return 0;
}