状态Dp[i][j]为前i件物品选j对的最优解
当i=j*2时,只有一种选择即 Dp[i-2][j-1]+(w[i]-w[i-1])^2
当i=j*2时,只有一种选择即 Dp[i-2][j-1]+(w[i]-w[i-1])^2
当i>j*2时,Dp[i][j] = min(Dp[i-1][j],Dp[i-2][j-1]+(w[j]-w[j-1])^2)
如果个数刚好,则从小到大依次开始搬可以疲劳度最小。
而如果n != 2 * k,则需要动态规划。
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 2001;
const int INF = 100000000;
int num[N],dp[N][N/2];
int Min(int a,int b)
{
return a>b?b:a;
}
int main()
{
int n, k;
while(cin >> n >> k)
{
int* w= new int[n];
for(int i = 0; i < n; i++)
cin >> w[i];
sort(w, w + n);
for(int i = 1; i < n; i++)
num[i] = (w[i] - w[i-1]) * (w[i] - w[i-1]);
if(2 * k == n)
{
int mii = 0;
for(int i = 2; i <= n; i += 2)
{
mii += num[i-1];
}
cout << mii << endl;
}
else
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=k;j++)
{
dp[i][j]=INF;
}
dp[i][0] = 0;
}
for(int i = 2; i <= n; i++)
{
for(int j = 1; j * 2 <= i; j++)
dp[i][j] = Min(dp[i-2][j-1] + num[i - 1], dp[i-1][j]);
}
cout << dp[n][k] << endl;
}
delete [] w;
}
return 0;
}