#include <bits/stdc++.h>
using namespace std;
const int maxn = 5050;
const double eps = 1e-8;
int n, m;
int a[maxn];
int dp[maxn][maxn][2];
int main() {
  while (~scanf("%d", &n)) {
    memset(dp, 0x7f, sizeof(dp));
    for (int i = 1; i <= n; i++) {
      scanf("%d", a + i);
    }
    dp[0][0][0] = dp[1][0][0] = dp[1][1][1] = 0;
    for (int i = 2; i <= n; i++) {
      for (int j = 0; j <= i; 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));
        if (j == 0) continue;
        dp[i][j][1] =
            min(dp[i][j][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, max(a[i - 1] - a[i - 2] + 1, a[i - 1] - a[i] + 1)));
      }
    }
    for (int i = 1; i <= (n + 1) / 2; i++)
      printf("%d ", min(dp[n][i][0], dp[n][i][1]));
    printf("\n");
  }
}
