题意:
给定一个序列 a a a,每次拿出来任意一个数(注意每次选的数不同),让后定义 m a x = m a x ( a 1 , a 2 , . . . , a i ) max=max(a_1,a_2,...,a_i) max=max(a1,a2,...,ai), m i n = m i n ( a 1 , a 2 , . . . , a i ) min=min(a_1,a_2,...,a_i) min=min(a1,a2,...,ai), d i = m a x − m i n d_i=max-min di=max−min,求 m i n ( d 1 + d 2 + , . . . , + d n ) min(d_1+d_2+,...,+d_n) min(d1+d2+,...,+dn)。
思路:
考虑将
a
a
a数组排序,我们发现排序之后只剩一个区间合并的问题了,即转换成将一个数添加到一个区间,且这个数一定与这个区间是相邻的,花费就是
a
[
r
]
−
a
[
l
]
a[r]-a[l]
a[r]−a[l]。说到这里很明显就是个去区间
d
p
dp
dp了,定义
f
[
l
]
[
r
]
f[l][r]
f[l][r]为
[
l
,
r
]
[l,r]
[l,r]的最小花费,考虑怎么扩展区间长度,比较容易想到如下转移方程:
f
[
l
]
[
r
]
=
m
i
n
(
f
[
l
]
[
r
]
,
m
i
n
(
f
[
l
]
[
r
−
1
]
,
f
[
l
+
1
]
[
r
]
)
+
a
[
r
]
−
a
[
l
]
)
f[l][r]=min(f[l][r],min(f[l][r-1],f[l+1][r])+a[r]-a[l])
f[l][r]=min(f[l][r],min(f[l][r−1],f[l+1][r])+a[r]−a[l])
不可能从中间转移,因为从中间合并两个长度的区间一定不优于从两头转移来的,所以不需要枚举
[
l
,
r
]
[l,r]
[l,r]转移,复杂度为
O
(
N
2
)
O(N^2)
O(N2)。
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid (tr[u].l+tr[u].r>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;
//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
const int N=2010,mod=1e9+7,INF=0x3f3f3f3f;
const double eps=1e-6;
int n;
LL f[N][N],a[N];
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
for(int len=2;len<=n;len++)
for(int l=1;l<=n-len+1;l++)
{
int r=l+len-1;
f[l][r]=1000000000000000;
}
sort(a+1,a+1+n);
for(int len=2;len<=n;len++)
for(int l=1;l<=n-len+1;l++)
{
int r=l+len-1;
f[l][r]=min(f[l][r],min(f[l+1][r],f[l][r-1])+a[r]-a[l]);
}
printf("%lld\n",f[1][n]);
return 0;
}
/*
*/