#include #define rep(i, n) for (int i = 0; i < n; ++i) typedef long long ll; using namespace std; int main() { int N; cin >> N; vector Y(N); rep(i, N) cin >> Y[i]; int mx = 1e4; vector> dp(N, vector(mx + 1, LONG_LONG_MAX)); rep(i, mx + 1) dp[0][i] = abs(i - Y[0]); for (int i = 1; i < N; ++i) { ll mn = LONG_LONG_MAX; rep(j, mx + 1) { mn = min(mn, dp[i - 1][j]); dp[i][j] = min(dp[i][j], mn + (ll)abs(Y[i] - j)); } } ll ans = LONG_LONG_MAX; rep(i, mx + 1) ans = min(ans, dp[N - 1][i]); cout << ans << endl; return 0; }