#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
vector<char*> tokenizer(const char* args) {
  char* token = new char[111];
  strcpy(token, args);
  token = strtok(token, ", ");
  vector<char*> v({token});
  while (token = strtok(NULL, ", ")) v.push_back(token);
  return reverse(v.begin(), v.end()), v;
}
void debugg(vector<char*> args) { cerr << "\b\b "; }
template <typename Head, typename... Tail>
void debugg(vector<char*> args, Head H, Tail... T) {
  debug() << " [" << args.back() << ": " << H << "] ";
  args.pop_back();
  debugg(args, T...);
}
long long mod = 1e9 + 7;
const int MX = 0x3f3f3f3f;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, j;
  cin >> n;
  int a[n + 1];
  for (i = 1; i <= n; i++) cin >> a[i];
  int dp1[n + 1][n], dp2[n + 1][n];
  memset(dp1, MX, sizeof(dp1));
  memset(dp2, MX, sizeof(dp2));
  dp2[0][0] = dp1[0][0] = 0;
  dp2[1][1] = dp1[1][1] = n > 1 ? max(0, a[2] + 1 - a[1]) : 0;
  dp2[1][0] = dp1[1][0] = 0;
  for (i = 2; i <= n; i++) {
    dp1[i][0] = dp2[i][0] = 0;
    dp1[i][1] =
        max(a[i - 1] + 1 - a[i], 0) + (i < n ? max(a[i + 1] + 1 - a[i], 0) : 0);
    dp2[i][1] = min(dp2[i - 1][1], dp1[i][1]);
    for (j = 2; j <= n; j++) {
      if (i >= 3)
        dp1[i][j] = dp2[i - 3][j - 1] + max(0, a[i - 1] + 1 - a[i]) +
                    (i < n ? max(0, a[i + 1] + 1 - a[i]) : 0);
      dp1[i][j] = min(dp1[i][j], dp1[i - 2][j - 1] +
                                     (i > 2 ? min(max(0, a[i - 1] + 1 - a[i]),
                                                  max(a[i - 2] - a[i], 0))
                                            : 0) +
                                     (i < n ? max(0, a[i + 1] + 1 - a[i]) : 0));
      dp2[i][j] = min(dp2[i - 1][j], dp1[i][j]);
      {};
    }
    {};
  }
  for (i = 1; i <= (n + 1) / 2; i++) {
    assert(dp2[n][i] < MX);
    cout << dp2[n][i] << " ";
  }
  return 0;
}
