#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n; cin >> n;
    
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i)cin >> a[i];

    int max_k = (n + 1) / 2;
    vector<vector<int>> prev_dp(max_k + 1, vector<int>(3, INF));
    prev_dp[0][0] = 0;
    prev_dp[1][1] = 0;
    
    for (int i = 2; i <= n; ++i) {
        vector<vector<int>> curr_dp(max_k + 1, vector<int>(3, INF));
        for (int j = 0; j <= (i + 1) / 2 && j <= max_k; ++j) {
            curr_dp[j][0] = min(prev_dp[j][0], prev_dp[j][2]);
            
            if (j > 0) {
                int val1 = prev_dp[j - 1][0] == INF ? INF : prev_dp[j - 1][0] + max(0, a[i - 1] - a[i] + 1);
                int val2 = INF;
                if (i >= 3 && prev_dp[j - 1][2] != INF) {
                    val2 = prev_dp[j - 1][2] + max(0, min(a[i - 1], a[i - 2] - 1) - a[i] + 1);
                }
                curr_dp[j][1] = min(val1, val2);
            }
            
            curr_dp[j][2] = prev_dp[j][1] == INF ? INF : prev_dp[j][1] + max(0, a[i] - a[i - 1] + 1);
        }
        prev_dp = move(curr_dp);
    }
    
    for (int k = 1; k <= max_k; ++k) {
        int ans = min({prev_dp[k][0], prev_dp[k][1], prev_dp[k][2]});
        cout << ans << (k == max_k ? "" : " ");
    }
    cout << "\n";
    
    return 0;
}