HDU 1421 搬寢室(動態規劃)

dp[i][j]表示從前i個裡選j對，dp[i][j]=min(dp[i-2][j-1]+(a[i]-a[i-1])^2,dp[i-1][j])

先排序，注意初始化

#include <iostream>#include <algorithm>#include <cmath>#include <cstring> using namespace std;int n,k,m,a[2005],dp[2005][2005];int main(){int i,j,ans;while(cin>>n>>k){for(i=1;i<=n;i++) cin>>a[i];sort(a,a+n+1); for(i=0;i<=n;i++)for(j=0;j<=k;j++){if(j==0) dp[i][j]=0;else if(i<2) dp[i][j]=1000000000;else dp[i][j]=min(dp[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]),dp[i-1][j]);}cout<<dp[n][k]<<endl;}return 0;}