#include<iostream>
using namespace std;
long long dp[5001][5001],h[5001];
int main()
{
	freopen("Mountains.in","r",stdin);
	freopen("Mountains.out","w",stdout);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>h[i];
	for(int i=1;i<n;i++)//枚举长度,0,1预处理为0 
	{
		for(int j=1;j+i<=n;j++)//begin
		{
			dp[j][j+i]=dp[j+1][j+i-1]+abs(h[j]-h[j+i]);
			//cout<<j<<" "<<j+i<<":"<<dp[j][j+i]<<"\n";
		}
	}
	for(int i=0;i<n;i++)
	{
		long long minn=(long long)1e9;
		for(int j=1;j+i<=n;j++)
		{
			//cout<<dp[j][j+i]<<" ";
			minn=min(minn,dp[j][j+i]);
		}
		//cout<<'\n';	
		cout<<minn<<" ";
	}
}
/*
dp[i][j]=dp[i+1][j-1]+abs(h[i]-h[j]) 
*/