#include <bits/stdc++.h>
using namespace std;
const int N = 5000 + 3;
int n;
int dp[N][2502][2];
int a[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= (n + 1) / 2; ++j)
      dp[i][j][0] = 1e9 + 7, dp[i][j][1] = 1e9 + 7;
  dp[0][0][0] = 0;
  dp[1][0][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 - 1][j - 1][0] + max(0, a[i - 1] - a[i] + 1),
                        dp[i - 2][j - 1][0] + max(0, a[i - 1] - a[i] + 1));
      dp[i][j][1] =
          min(dp[i][j][1],
              dp[i - 2][j - 1][1] + max(0, a[i - 1] - min(a[i - 2], a[i]) + 1));
    }
  }
  for (int i = 1; i <= (n + 1) / 2; ++i)
    cout << min(dp[n][i][0], dp[n][i][1]) << " ";
}
