1008 Elevator (20分)（一个字短！）

1008 Elevator (20分)

题目

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

题意

计算电梯运行时间，包括上行、下行、停留时间

分析

根据当前楼层以及下一楼层，计算在楼层之间移动的时间，最后加上停留时间综合

代码

#include<iostream>
using namespace std;
int main() {
 	int n, a, s, b;
 	scanf("%d %d", &n, &a);
 	s = (a - 0) * 6;
 	s += n * 5;
 	while (--n > 0) {
  		scanf("%d", &b);
  		s += (b - a) > 0 ? (b - a) * 6 : (a - b) * 4;
  		a = b;
 	}
 	printf("%d", s);
 	return 0;
}