被题意秀了一脸,实际上第三个操作只能往后面的树去跳。
#include <iostream>
#include <cstdio>
#include <list>
#include <stack>
#include <queue>
#include <cstdlib>
#include <set>
#include <map>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
#define INF 0x3f3f3f3f
#define ll long long
int a[200005], n;
int main()
{
while (cin >> n) {
ll sum = 0;
a[0] = 1;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
sum = sum + abs(a[i] - a[i - 1]) + 2;
}
cout << sum << endl;
}
return 0;
}