【PAT甲级】1008. Elevator (20)

题目：https://www.patest.cn/contests/pat-a-practise/1008
超简单……感觉什么坑也没有。

#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;

int main() {
    int N;
    int floor;
    int time = 0;
    vector<int> floors;
    cin >> N;
    for (int i = 0;i <= N;i++) {
        if(i==0)
            floors.push_back(0);
        else {
            cin >> floor;
            floors.push_back(floor);
        }
    }
    for (int i = 0;i < N;i++) {
        if (floors[i + 1] > floors[i]) {
            time += 6 * (floors[i + 1] - floors[i]);
        }
        else if (floors[i + 1] < floors[i]) {
            time += 4 * (floors[i] - floors[i + 1]);
        }
        time += 5;
    }
    cout << time;
    return 0;
}