(PAT)1008.Elevator

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    vector<int> vec;
    int mvUp=6;
    int mvDown=-4;
    int stop=5;
    cin>>n;
    int k=n;
    while(k)
    {
        int req;
        cin>>req;
        vec.push_back(req);
        k--;
    }
    int sum=0;
    int lastReq=0;
    for(int i=0;i<vec.size();i++)
    {
        int minus=vec[i]-lastReq;
        if(minus>0)sum+=mvUp*minus;
        else sum+=mvDown*minus;
        lastReq=vec[i];
    }
    sum+=n*stop;
    cout<<sum;
}

一道水题,记录一下.