记录编号	608915	评测结果	AAAAAAAAA
题目名称	4188.Symmetric Mountains	最终得分	100
用户昵称	李金泽	是否通过	通过
代码语言	C++	运行时间	0.742 s
提交时间	2025-10-30 15:58:10	内存使用	52.45 MiB

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 5005
#define ll long long
#define ul unsigned long long
#define int long long
#define db double 
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
int n,m,a[N],f[N][N],ans;const int inf=1e18;
int abs(int x,int y){return x>y?x-y:y-x;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("Mountains.in","r",stdin);freopen("Mountains.out","w",stdout);
	n=read();fo(i,1,n)a[i]=read();
	printf("0 ");
	fo(k,2,n)
	{
		ans=inf;
		for(int i=1,j=i+k-1;j<=n;i++,j++)
			ans=min(ans,f[i][j]=f[i+1][j-1]+abs(a[i],a[j]));
		printf("%lld ",ans);
	}
	return 0;
}