Problem G

模拟~

还是读题, 开始没看清条件, 吓死了俄了, 如果老鼠可以跳回来, 那就是求最优问题了,  深搜orDP , 胡思乱想~~~

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <algorithm>
//#include "myAlgorithm.h"

#define MAX 100005
#define INF (1e8 + 5)
#define eps 1e-30
#define Rep(s, e) for( int i = s; i <= e; i++)
using namespace std;
int n,  a[MAX];
int main()
 {
    //freopen("in.txt", "w", stdout);
    while(cin>>n){
        Rep(1, n)cin>>a[i];
        int ans = a[1] + n, pre = a[1];
        Rep(2, n){
            ans += abs(a[i] - pre) + 1;
            pre  = a[i];
        }
        cout<<ans<<endl;
    }
    return 0;
}
/*

*/