C - Elevator
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
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.
Output
Print the total time on a single line for each test case.
Sample Input
1 2 3 2 3 1 0
Sample Output
17 41
大致意思:
开始在0层(这个题里没说),按顺序依次走完各个楼层,上一层楼6s,下一层楼4s,每到一个目标停5s,无需返回,求最终时间。
简单粗暴(当然当时由于读题没读懂半天才明白17的由来)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
int n;
int a[105];
int i,that,sum;
while (~scanf("%d", &n) && n) {
that = 0;
sum = 0;
while (n--) {
scanf("%d", &i);
sum += 5+ (i>that ? (i-that)*6 : (that-i)*4);
that = i;
}
printf("%d\n", sum);
}
return 0;
}