#include <bits/stdc++.h>
using namespace std;
int n;
int h[5005];
int dp[5005][2525][2];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &h[i]);
  memset(dp, 127, sizeof(dp));
  dp[0][0][0] = dp[1][1][1] = dp[1][0][0] = 0;
  for (int i = 2; i <= n; i++) {
    for (int j = 0; j <= (i + 1) / 2; j++) {
      dp[i][j][0] =
          min(dp[i - 1][j][0], dp[i - 1][j][1] + max(0, h[i] - h[i - 1] + 1));
      if (j)
        dp[i][j][1] = min(
            dp[i - 2][j - 1][0] + max(0, h[i - 1] - h[i] + 1),
            dp[i - 2][j - 1][1] + max(0, h[i - 1] - min(h[i - 2], h[i]) + 1));
    }
  }
  for (int i = 1; i <= (n + 1) / 2; i++) {
    printf("%d ", min(dp[n][i][0], dp[n][i][1]));
  }
}
