HDU 1008 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.


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.


Print the total time on a single line for each test case.

Sample Input

1 2
3 2 3 1

Sample Output


题意: 电梯往上走6分钟,往下走4分钟,每到一个目的地停5分钟。

#include <stdio.h>

int main(){
	int n;
	while(scanf("%d", &n) && n){
		int sum = 0, k, a[105] = {0};
		for(int i = 1; i <= n; i++){
			scanf("%d", &a[i]);
			int s = a[i] - a[i - 1];
			if(s > 0) sum += s * 6;
			else sum += -1 * s * 4;
			sum += 5; 
		printf("%d\n", sum);
	return 0;


©️2020 CSDN 皮肤主题: 游动-白 设计师:上身试试 返回首页