#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios_base::sync_with_stdio(false);
  long long n;
  cin >> n;
  long long a[n + 10];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long z = (n / 2) + (n % 2);
  long long dp[n + 10][z + 5][2];
  for (long long i = 0; i < n + 10; i++)
    for (long long j = 0; j < z + 5; j++)
      dp[i][j][0] = 10000000000, dp[i][j][1] = 10000000000;
  dp[0][0][0] = 0;
  dp[0][1][1] = 0;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < z + 1; j++) {
      long long tt = dp[i][j][0];
      if (tt != 10000000000) {
        dp[i + 1][j][0] = min(dp[i + 1][j][0], tt);
        dp[i + 1][j + 1][1] = min(dp[i + 1][j + 1][1],
                                  tt + max((long long)0, a[i] - a[i + 1] + 1));
      }
      tt = dp[i][j][1];
      if (tt != 10000000000) {
        dp[i + 2][j + 1][1] =
            min(dp[i + 2][j + 1][1],
                tt + max(max((long long)0, a[i + 1] - a[i] + 1),
                         max((long long)0, a[i + 1] - a[i + 2] + 1)));
        dp[i + 1][j][0] =
            min(dp[i + 1][j][0], tt + max((long long)0, a[i + 1] - a[i] + 1));
      }
    }
  }
  for (long long i = 1; i < z + 1; i++)
    cout << min(dp[n - 1][i][1], dp[n - 1][i][0]) << " ";
}
