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.

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

题意分析：从0层开始计算，上升过程中每层用6秒，下降过程中每次用4秒。到达要求的楼层后停留5秒。按顺序计算即可。题不难。

#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;

int main()
    int N,temp,M,time;//N上下电梯次数，temp记录当前要去的层数，M当前停留在层数
    M=0,time=0;//对数据进行初始化
    scanf("%d",&N);
    for(int i=0;i<N;i++){
        scanf("%d",&temp);
        time=5+time+((temp-M)>0?6*(temp-M):4*(M-temp));//通过计算楼层的变化，计算出需要的时间
        M=temp;//记录电梯变化后的位置
    }
    printf("%d",time);
}