#include <bits/stdc++.h>
using namespace std;
const int N = 5050;
int n, a[N], dp[N][N][2];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  a[0] = a[n + 1] = -1e6;
  memset(dp, 0x3f, sizeof(dp));
  dp[0][0][0] = dp[1][0][0] = dp[1][1][1] = 0;
  for (int i = 2; i <= n; ++i) {
    dp[i][0][0] = 0;
    for (int j = 1; j <= (i + 1) / 2; ++j) {
      dp[i][j][0] =
          min(dp[i - 1][j][0], dp[i - 1][j][1] + max(0, a[i] - a[i - 1] + 1));
      dp[i][j][1] =
          min(dp[i - 2][j - 1][0] + max(0, a[i - 1] - a[i] + 1),
              dp[i - 2][j - 1][1] + max(0, a[i - 1] - min(a[i], a[i - 2]) + 1));
    }
  }
  for (int k = 1; k <= (n + 1) / 2; ++k) {
    cout << min(dp[n][k][0], dp[n][k][1]) << " ";
  }
  return 0;
}
