题目:http://acm.hdu.edu.cn/showproblem.php?pid=1421
思路:思路来自百度。
这是一道dp,先对数组排序,那么可以求单个数的左右最优解。定义dp[i][j]为从前i个数中取j对数,符合题意的要求,假设dp[i][j]中有第i个物品,那么第i个物品一个和第i-1个物品配对,于是有dp[i][j] = dp[i-2][j-1] + (arr[i] - arr[i-1]) * (arr[i] - arr[i-1]),当dp[i][j]中不含第i个物品时,那么dp[i][j] = dp[i-1][j]。于是得状态转移方程为dp[i][j] = min(dp[i-1][j],dp[i-2][j] + (arr[i] - arr[i-1]) * (arr[i] - arr[i-1]))。注意当j=0时,dp[i][0] = 0
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <cctype>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 2010;
int dp[N][1010];
int main()
{
int t, n, k;
int arr[N];
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++)
scanf("%d", arr + i);
sort(arr + 1, arr + n + 1);
for(int i = 0; i <= n; i++) /*刚开始用memset对整个数组初始化INF,结果WA*/
for(int j = 1; j <= k; j++)
dp[i][j] = INF;
for(int i = 2; i <= n; i++)
for(int j = 1; j * 2 <= i; j++)
dp[i][j] = min(dp[i-1][j], dp[i-2][j-1] + (arr[i] - arr[i-1]) * (arr[i] - arr[i-1]));
printf("%d\n", dp[n][k]);
}
return 0;
}