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
作者
CHEN, Yue
单位
浙江大学
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
大意:电梯上、下、停都需要时间,问电梯运行了几层后用了多少时间。
一刷:柳:
#include <iostream>
using namespace std;
int main() {
int a, now = 0, sum = 0;
cin >> a; //因为给的第一个层数 没有用 而a在后面还会赋值 所以让层数赋给a 后面再次赋值就给覆盖掉了 有点巧妙
while(cin >> a) {
if(a > now)
sum = sum + 6 * (a - now);
else
sum = sum + 4 * (now - a);
now = a;
sum += 5;
}
cout << sum;
return 0;
}
二刷:吾:
#include <iostream>
#include <vector>
using namespace std;
void fun(vector<int> v)
{
int now = 0,t=0;
for (int i = 0; i < v.size(); i++)
{
int k = v[i] - now;
if (k>0)
{
t += k * 6 ;
}
else if(k<0)
{
t += (-k) * 4;
}
now = v[i];
}
t += 5 * v.size();
cout << t << endl;
}
int main()
{
//freopen("in.txt", "r", stdin);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
fun(v);
return 0;
}