1008. Elevator (20)

http://www.patest.cn/contests/pat-a-practise/1008

#include <cstdio>#include <iostream>using namespace std;int main () {    int n;    int val[101];    cin >> n;    for (int i = 0; i < n; i++) {        scanf("%d",&val[i]);    }    int cur_loca = 0;    int sum = 0;    for (int i = 0; i < n; i++) {        if (val[i] > cur_loca) {            sum += (val[i] - cur_loca)*6;            cur_loca = val[i];        }         else if (val[i] < cur_loca) {            sum += (cur_loca - val[i])*4;            cur_loca = val[i];        }        sum += 5;    }    cout << sum << endl;    return 0;}