思路:题目求的是求k对物品,然后总的疲劳值是最小的;疲劳值等于这对物品重量差的平方(w[i] - w[i - 1]) * (w[i] - w[i - 1]);
那么对于第i个物品的问题,选它的话,那么改和那一个物品组合呢(可以使的疲劳值最低)?
不选的话就考虑下一个;
所以可以分析出来前i个物品组成几对的问题了。
dp[i][j]就表示前i喝物品组成j对的最小疲劳和;
我们现在再来谈谈i与谁组合的问题,我们可以看着么个式子a < b < c < d;
这里有四个物品,对其进行组合,可以看出1.ab & cd ! 2.ac & bd ! 3.ad & bc;
显然有:
(a - b) ^ 2 + (c - d) ^ 2 < (a - c) ^ 2 + (b - d) ^ 2;
(a - b) ^ 2 + (c - d) ^ 2 < (a - d) ^ 2 + (b - c) ^ 2;
所以我们应该先排个序,然后再才来考虑选与不选的问题;
选:那么就是和第(i - 1)个进行组合,同时也就是前(i - 2)个组合成(j - 1)对,dp[i][j] = dp[i - 2][j - 1] + (w[i] - w[i - 1]) * (w[i] - w[i - 1]);
不选:那么就是dp[i][j] = dp[i - 1][j];
综上:dp[i][j] = min(dp[i - 1][j],dp[i - 2][j - 1] + (w[i] - w[i- 1]) * (w[i] - w[i - 1]));
/*****************************************
Author :Crazy_AC(JamesQi)
Time :2015
File Name :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
#define pk push_back
template<class T> inline T Get_Max(const T&a,const T&b){return a < b?b:a;}
template<class T> inline T Get_Min(const T&a,const T&b){return a < b?a:b;}
typedef long long ll;
typedef pair<int,int> ii;
const int inf = 1100000000;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 2020;
int w[N];
int dp[N][N / 2];
int main()
{
// ios::sync_with_stdio(false);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n,k;
while(~scanf("%d%d",&n,&k)){
for (int i = 1;i <= n;++i)
scanf("%d",&w[i]);
sort(w + 1,w + 1 + n);
for (int i = 0;i <= n;++i)
for (int j = 1;j <= i * 2;++j)
dp[i][j] = inf;
for (int i = 0;i <= n;++i)
dp[i][0] = 0;
for (int i = 2;i <= n;++i){
for (int j = 1;j * 2<= i;++j)
dp[i][j] = Get_Min(dp[i - 1][j],dp[i - 2][j - 1] + (w[i] - w[i - 1]) * (w[i] - w[i - 1]));
}
printf("%d\n",dp[n][k]);
}
return 0;
}