hdu5073 贪心 + 公式拆解

分析：

我来就大胆猜了一个很有道理的结论，一定是连续的$n - k$个不变，然后扫一遍计算。很巧的一个贪心。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <stack>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define xx first
#define yy second
#define pr(x) cout << #x << " " << x << " "
#define prln(x) cout << #x << " " << x << endl
template<class T> inline T lowbit(T x) { return x & (-x); }

const int MAXN = 5e4 + 5;
double sum[MAXN], sqr_sum[MAXN];
int d[MAXN];

int T;
int n, k;
int main(void) {
#ifdef LOCAL 
    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
#endif
    scanf("%d", &T);
    while(T--) {
        scanf("%d%d", &n, &k);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &d[i]);
        }
        if(n == k) {
            puts("0");
            continue;
        }
        k = n - k;
        sort(d + 1, d + n + 1);
        for (int i = 1; i <= n; i++) {
            sum[i] = sum[i-1] + d[i];
            sqr_sum[i] = sqr_sum[i-1] + double(d[i]) * d[i];
        }
        double ans = 1e18;
        for (int i = k; i <= n; i++) {
            double o = (sum[i] - sum[i-k]) / k;
            ans = min(ans, sqr_sum[i] - sqr_sum[i-k] -
                    2*(sum[i] - sum[i-k])*o + k * o * o);
        }
        printf("%.15f\n", ans);
    }
    return 0;
}