究极大水题
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define FOR(i,a,n) for (int i=a;i<n;i++)
#define FRO(i,n,a) for (int i=n;i>a;i--)
#define mst(a,i) memset(a,i,sizeof a)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define eps 1e-6
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
const int mod = 1000000007;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
const int N = 1e5+6;
// const int MAXN=1e4;
// int a[N]={};
// int b[N]={};
int main(){
int n;
cin >> n;
int next = 0, now = 0, ans = 0;
FOR(i,0,n)
{
cin >> next;
if(next > now)
{
ans += 6 * (next - now) + 5;
}
else
{
ans += 4 * (now - next) + 5;
}
now = next;
}
cout << ans ;
return 0;
}