#include #include #include #include #include #include #include #define rep(i, a, b) for (int i = int(a); i < int(b); i++) using namespace std; using ll = long long int; using P = pair; // clang-format off #ifdef _DEBUG_ #define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false) template void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; } #else #define dump(...) do{ } while(false) #endif template vector make_v(size_t a, T b) { return vector(a, b); } template auto make_v(size_t a, Ts... ts) { return vector(a, make_v(ts...)); } template bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; } template bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; } template void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; } template void input(Ts&... ts) { (cin >> ... >> ts); } template istream &operator,(istream &in, T &t) { return in >> t; } // clang-format on #include template class FlatVector : public vector { private: array args; public: template FlatVector(F &&init, Index... arg) : vector((arg * ...), forward(init)), args({static_cast(arg)...}) {} T &idx(Index... arg) { array _args = {static_cast(arg)...}; size_t index = 0; for (size_t i = 0; i < sizeof...(Index); i++) { index *= args[i]; index += _args[i]; } return this->operator[](index); } }; template FlatVector(T, Index...) -> FlatVector; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin, n; vector y(n); rep(i, 0, n) { cin, y[i]; } ll inf = 1LL << 60; const int SZ = 10010; FlatVector dp(inf, n + 1, SZ); dp.idx(0, 0) = 0; rep(i, 0, n) { ll m = inf; rep(j, 0, SZ) { chmin(m, dp.idx(i, j)); ll cost = m + abs(j - y[i]); chmin(dp.idx(i + 1, j), cost); } } ll ans = inf; rep(i, 0, SZ) { chmin(ans, dp.idx(n, i)); } print(ans); return 0; }