Codeforces Round #715 1509C - The Sports Festival 补题

1509C - The Sports Festival（记忆化+dp）

原题

The student council is preparing for the relay race at the sports festival.

The council consists of n members. They will run one after the other in the race, the speed of member i is s_i. The discrepancy d_i of the i-th stage is the difference between the maximum and the minimum running speed among the first i members who ran.

Formally, if a_i denotes the speed of the i-th member who participated in the race, then d_i=max(a₁,a₂,…,a_i)−min(a₁,a₂,…,a_i).

You want to minimize the sum of the discrepancies d₁+d₂+⋯+d_n. To do this, you are allowed to change the order in which the members run. What is the minimum possible sum that can be achieved?

Input

The first line contains a single integer n (1≤n≤2000) — the number of members of the student council.

The second line contains n integers s₁,s₂,…,s_n (1≤s_i≤109) – the running speeds of the members.

Output

Print a single integer — the minimum possible value of d₁+d₂+⋯+d_n after choosing the order of the members.

Examples

input
3
3 1 2
output
3
input
1
5
output
0
input
6
1 6 3 3 6 3
output
11
input
6
104 943872923 6589 889921234 1000000000 69
output
2833800505

Note

In the first test case, we may choose to make the third member run first, followed by the first member, and finally the second. Thus a₁=2, a₂=3, and a₃=1. We have:

d₁=max(2)−min(2)=2−2=0.
d₂=max(2,3)−min(2,3)=3−2=1.
d₃=max(2,3,1)−min(2,3,1)=3−1=2.
The resulting sum is d₁+d₂+d₃=0+1+2=3. It can be shown that it is impossible to achieve a smaller value.

In the second test case, the only possible rearrangement gives d₁=0, so the minimum possible result is 0.

题意

给定长度为n的数组a,规定每一项i(1≤i≤n),有d_i=max(a₁,a₂,…,a_i)−min(a₁,a₂,…,a_i) .改变数组顺序使得d₁+d₂+⋯+d_n 的值最小

Solution

首先考虑最后一项d_n,设数组a中所有元素最大值为a_max,最小值为a_min,则一定有d_n=a_max-a_min

那么在已知d_n 为定值的情况下，只需要使d₁+d₂+⋯+d_n-1 的值最小。

那么此时先考虑d_n-1，不难推知，要使d_n-1 尽可能小，必须满足a_n=a_max 或 a_n=a_min.

反证：若 a_n!=a_max && a_n!=a_min ，则一定有d_n-1=a_max-a_min，此时d_n-1为最大值，不满足d_n-1尽可能小

得出如上结论后，将数组a按升序排序，排序后a[n]={a₁,a₂,…,a_n}，此时b_n=a_n-a₁,由上述证明知b_n-1=min{a_n-a₂,a_n-1-a₁}.

在求得d_n-1 的最小值后，同理可以根据使b_n-1 最小时的状态继续求得b_n-2 的最小值。

从而得出状态转移方程：dp(1,n)=(a_n-a₁)+max{dp(2,n),dp(1,n-1)}

代码实现

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=2010;
int a[N],d[N][N];
int dp(int l,int r) //dp求解
{
    if(d[l][r]!=-1) return d[l][r]; //记忆化处理，处理后时间复杂度为O(n^2) 
    if(l==r) return 0;  //边界状态，只有一个数时d=0
    return d[l][r]=a[r]-a[l]+min(dp(l+1,r),dp(l,r-1));
}
signed main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
    memset(d,-1,sizeof(d));
    cout<<dp(1,n);
}