#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int a[n + 1];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  a[n] = 0;
  int dp[n + 5][n / 2 + 5][2];
  for (int i = 0; i < n + 5; i++) {
    for (int j = 0; j <= i / 2 + 1; j++) {
      dp[i][j][0] = 5e8;
      dp[i][j][1] = 5e8;
    }
  }
  dp[0][0][0] = 0;
  dp[1][0][0] = 0;
  dp[2][1][1] = max(0, a[1] - a[0] + 1);
  for (int i = 1; i < n; i++) {
    for (int j = 0; j <= i / 2; j++) {
      dp[i + 1][j][0] = min(dp[i + 1][j][0], dp[i][j][0]);
      dp[i + 2][j + 1][1] =
          min(dp[i + 2][j + 1][1], dp[i][j][0] + max(0, a[i - 1] - a[i] + 1) +
                                       max(0, a[i + 1] - a[i] + 1));
    }
    for (int j = 0; j <= i / 2; j++) {
      dp[i + 1][j][0] = min(dp[i + 1][j][0], dp[i][j][1]);
      dp[i + 2][j + 1][1] =
          min(dp[i + 2][j + 1][1],
              dp[i][j][1] + max(0, min(a[i - 2] - 1, a[i - 1]) - a[i] + 1) +
                  max(0, a[i + 1] - a[i] + 1));
    }
  }
out:
  for (int i = 1; i <= n / 2 + n % 2; i++) {
    cout << min(min(dp[n][i][0], dp[n + 1][i][0]),
                min(dp[n][i][1], dp[n + 1][i][1]))
         << " ";
  }
  return 0;
}
