【題解】Codeforces 1509C. The Sports Festival

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 2005;
long long dp[maxn][maxn];
int s[maxn]; //input data

long long solve(int l, int r) {
    if (dp[l][r] != -1) return dp[l][r];
    if (l == r) return dp[l][r] == 0;
    dp[l][r] = s[r] - s[l] + min(solve(l+1, r), solve(l, r-1));
    return dp[l][r];
}

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }
    sort(s, s+n);
    memset(dp, -1, sizeof(dp));
    cout << solve(0, n-1) << "\n";
    return 0;
}