1008 Elevator (20 point(s))
简单模拟,巨水
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e6+10;
const int inf_int = 1e9;
int N,ans = 0;
int a[maxn];
int main(){
cin>>N;
for(int i = 1;i<=N;i++) cin>>a[i];
for(int i = 0;i<N;i++){
if(a[i] < a[i+1]){
ans += (a[i+1] - a[i]) * 6;
}else{
ans += (a[i] - a[i+1]) * 4;
}
}
printf("%d\n",ans + 5 * N);
return 0;
}