hdu 1421

搬寝室

#include<bits/stdc++.h>
using namespace std;
#define INF 0x7fffffff //int型最大值
#define MAXN 2020
bool cmp(int a,int b){
	return a>b;
}
int n,k,dp[MAXN][MAXN],a[MAXN];
int main(){
	while(scanf("%d %d",&n,&k)!=EOF){
		for(int i=1;i<=n;++i){
			scanf("%d",&a[i]);
		}
		sort(a+1,a+n+1,cmp);
		for(int i=0;i<=n;++i){
			dp[i][0]=0;
			for(int j=1;j<=k;++j)
			dp[i][j]=INF;
		}
		for(int i=1;i<=n;++i){
			for(int j=1;j<=i/2;++j){
				dp[i][j]=min(dp[i-1][j],dp[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]));
			}
		}
		printf("%d\n",dp[n][k]); 
	}
	return 0;
}