hdu 1421 搬寝室 DP

思路:dp[i][j] = min(dp[i-2][j-1] + (val[i]-val[i-1])*(val[i]-val[i-1]),dp[i-1][j]); dp[i][j]代表在i件物品中取j对的最小的结果。

http://acm.hdu.edu.cn/showproblem.php?pid=1421

#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define rep(i,a,b)  for(int i = a ; i <= b ; i ++)
#define rrep(i,a,b) for(int i = b ; i >= a ; i --)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x)   memset(a,x,sizeof(a))

using namespace std;

typedef long long LL;

const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 2e3+5;
const int MAXE = 1e6+5;

int T,n,m;
int val[MAXN];
int dp[MAXN][MAXN];

void input() {
    rep(i,1,n) {
        scanf("%d",val+i);
    }   
}

void solve() {
    sort(val+1,val+n+1);
    cls(dp,0x3f);
    dp[0][0] = 0 ; dp[1][0] = 0;
    rep(i,2,n) {
        dp[i][0] = 0;
        rep(j,1,i/2) {
            dp[i][j] = min(dp[i-2][j-1]+(val[i]-val[i-1])*(val[i]-val[i-1]),dp[i-1][j]);
        }
    }
    printf("%d\n",dp[n][m]);
}   

int main(void) {
    //freopen("a.in","r",stdin);
    //scanf("%d",&T);
    while(~scanf("%d %d",&n,&m)) {
        input();
        solve();
    }
    return 0;
}