#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  const int K = (n + 1) / 2;
  vector<vector<vector<int>>> dp(
      n + 1, vector<vector<int>>(K + 1, vector<int>(2, 1e9)));
  for (int i = 0; i < dp.size(); ++i) {
    dp[i][0][0] = 0;
  }
  dp[1][1][1] = 0;
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j <= K; ++j) {
      dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j][0]);
      dp[i][j][0] =
          min(dp[i][j][0], dp[i - 1][j][1] + max(0, a[i] - a[i - 1] + 1));
      dp[i][j][1] =
          min(dp[i][j][1], dp[i - 2][j - 1][0] + max(0, a[i - 1] - a[i] + 1));
      if (i > 2) {
        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 <= K; ++i) {
    cout << min(dp[n][i][0], dp[n][i][1]) << ' ';
  }
  cout << endl;
  return 0;
}
