方法:数学。
#include <iostream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <ctime>
using namespace std;
const int maxn = 100+10;
int main()
{
#ifdef Local
freopen("a.in", "r", stdin);
#endif
int i = 0, n = 0;
while (cin >> n && n)
{
int num[maxn], x = 0, sum = 0, temp = 0;
memset(num, 0, sizeof(num));
for (i = 1; i <= n; i++)
{
cin >> x;
num[i] = x;
}
for (i = 1; i <= n; i++)
{
temp = num[i] - num[i-1];
if (temp >=0)
sum += temp * 6;
else
sum += temp * -4;
}
sum += n * 5;
cout << sum << endl;
}
return 0;
}