#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int mxN = 5005;
ll n,a[mxN],dp[mxN][mxN],dp1[mxN][mxN];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	ll k = (n + 1) / 2;
	for(int i = 1; i <= n; i++) cin >> a[i];
	if(n == 1){
		cout << 0;
		return 0;
	}
	for(int i = 0; i <= n; i++) for(int j = 1; j <= k; j++) dp[i][j] = dp1[i][j] = 1e14;
	dp1[1][1] = dp[1][1] = max(0LL, a[2] - a[1] + 1);
	dp1[2][1] = dp[2][1] = max(0LL, a[1] - a[2] + 1) + max(0LL, a[3] - a[2] + 1);
	dp[2][1] = min(dp[2][1], dp[1][1]);
	for(int i = 3; i <= n; i++){
		dp1[i][1] = max(0LL, a[i - 1] - a[i] + 1) + max(0LL, a[i + 1] - a[i] + 1);
		dp[i][1] = min(dp[i - 1][1], dp1[i][1]);
		for(int j = 2; j <= k; j++){
			dp1[i][j] = max(0LL, a[i + 1] - a[i] + 1) + max(0LL, a[i - 1] - a[i] + 1) + dp[i - 3][j - 1];
			if(a[i] > a[i - 2]) dp1[i][j] = min(dp1[i][j], max(0LL, a[i + 1] - a[i] + 1) + dp1[i - 2][j - 1]);
			else dp1[i][j] = min(dp1[i][j], max(0LL, a[i + 1] - a[i] + 1) + max(0LL, a[i - 1] - a[i] + 1) - max(0LL, a[i - 1] - a[i - 2] + 1) + dp1[i - 2][j - 1]);	
			dp[i][j] = min(dp[i - 1][j], dp1[i][j]);
//			cout << i << ' ' << j << ' ' << dp1[i][j] << ' ' << dp[i][j] << '\n';
		} 
	}
	for(int i = 1; i <= k; i++) cout << dp[n][i] << ' ';
}