from collections import defaultdict, deque
from functools import lru_cache
from heapq import heappush, heappop
from typing import Counter
from bisect import bisect_right, bisect_left
import math
hpop = heappop
hpush = heappush
def solution():
n = int(input())
arr = []
for _ in range(n):
arr.append(int(input()))
time = n + arr[0]
for i in range(1, len(arr)):
time += abs(arr[i] - arr[i-1]) + 1
print(time)
def main():
t = 1
for _ in range(t):
solution()
main()
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n; cin >> n;
int h[n];
for(int i=0; i<n; i++) cin>>h[i];
int time =0;
time += h[0];
time++; //eat nut on first tree
for(int i=1; i<n; i++) {
if(h[i] > h[i-1]) {
time += h[i]-h[i-1];
}
else time += h[i-1] - h[i];
time++; //jump to next tree
time++; //eat nut on the current tree
}
cout<<time<<endl;
return 0;
}347. Top K Frequent Elements | 1503. Last Moment Before All Ants Fall Out of a Plank |
430. Flatten a Multilevel Doubly Linked List | 1290. Convert Binary Number in a Linked List to Integer |
1525. Number of Good Ways to Split a String | 72. Edit Distance |
563. Binary Tree Tilt | 1306. Jump Game III |
236. Lowest Common Ancestor of a Binary Tree | 790. Domino and Tromino Tiling |
878. Nth Magical Number | 2099. Find Subsequence of Length K With the Largest Sum |
1608A - Find Array | 416. Partition Equal Subset Sum |
1446. Consecutive Characters | 1618A - Polycarp and Sums of Subsequences |
1618B - Missing Bigram | 938. Range Sum of BST |
147. Insertion Sort List | 310. Minimum Height Trees |
2110. Number of Smooth Descent Periods of a Stock | 2109. Adding Spaces to a String |
2108. Find First Palindromic String in the Array | 394. Decode String |
902. Numbers At Most N Given Digit Set | 221. Maximal Square |
1200. Minimum Absolute Difference | 1619B - Squares and Cubes |
1619A - Square String | 1629B - GCD Arrays |