#include <bits/stdc++.h> #define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i)) #define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i)) #define rep(i, n) For((i), 0, (n)) #define rrep(i, n) rFor((i), (n), 0) #define fi first #define se second using namespace std; typedef long long lint; typedef unsigned long long ulint; typedef pair<int, int> pii; typedef pair<lint, lint> pll; template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;} template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;} template<class T> T div_floor(T a, T b){ if(b < 0) a *= -1, b *= -1; return a>=0 ? a/b : (a+1)/b-1; } template<class T> T div_ceil(T a, T b){ if(b < 0) a *= -1, b *= -1; return a>0 ? (a-1)/b+1 : a/b; } constexpr lint mod = 1e9+7; constexpr lint INF = mod * mod; constexpr int MAX = 10010; int main(){ int n; scanf("%d", &n); int a[n]; rep(i, n) scanf("%d", &a[i]); int dp[2][MAX]; rep(i, 2)rep(j, MAX) dp[i][j] = mod; rep(j, MAX) dp[0][j] = 0; rep(i, n){ rep(j, MAX)if(dp[0][j] < mod){ chmin(dp[1][j], dp[0][j] + abs(j - a[i])); } rep(j, MAX){ dp[0][j] = dp[1][j]; dp[1][j] = mod; if(j > 0) chmin(dp[0][j], dp[0][j-1]); } } printf("%d\n", dp[0][MAX-1]); }