一共n间物品,每次搬2个,一共搬k次,疲劳度为每次2个物品重量差的平方和,求最小疲劳度。
1.a < b < c < d
可证,(a - b) ^ 2 + (c - d) ^ 2 < (a - c) ^ 2 + (b - d) ^ 2
(a - b) ^ 2 + (c - d) ^ 2 < (a - d) ^ 2 + (b - c) ^ 2
所以每次取相邻的更小
2.由 1 4 5 8这组数据可知,不能贪心
3.递推 设dp[ i ][ j ]为从前i个中取j对物品的最小疲劳度,
则若取第i个,因为要取相邻的,所以一定取了第 i - 1个,此时疲劳度为 dp[ i - 2][ j - 1] + (num[ i ] - num[ i - 1]) * (num[ i ] - num[ i - 1])
若不取第i个,疲劳度为dp[i - 1] [ j ]
dp[ i ] [ j ] = min( dp[ i - 2][ j - 1] + (num[ i ] - num[ i - 1]) * (num[ i ] - num[ i - 1]) , dp[i - 1] [ j ] )
4.边界条件 当n < 2 * k时,都无法取,因为要求最小值,所以都初始化为inf
在n个中取1对时,就取,相差最小的那对
//DP求min时记得初始化为inf
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 2005;
int dp[maxn][maxn],num[maxn];
const int INF = 1 << 30;
int sum2(int a,int b)
{
return (a - b) * (a - b);
}
int main()
{
int n,k;
while(scanf("%d%d",&n,&k) != EOF)
{
for (int i = 0; i <= n; i ++) {
for (int j = 0; j <= k; j ++) {
dp[i][j] = INF;
}
} memset(num,0,sizeof(num));
for (int i = 1; i <= n; i ++) {
scanf("%d",&num[i]);
}
sort(num + 1,num + 1 + n);
dp[2][1] = sum2(num[1] , num[2]);
for (int i = 3; i <= n; i ++) {
dp[i][1] = min(dp[i - 1][1],sum2(num[i], num[i - 1]));
}
for (int i = 2; i <= n; i ++) {
for (int j = 2; j <= k; j ++) {
if (i >= 2 * j) {
dp[i][j] = min(dp[i - 2][j - 1] + sum2(num[i - 1], num[i]),dp[i - 1][j]);
}
}
}
printf("%d\n",dp[n][k]);
}
return 0;
}