hdu 1421 搬寝室(dp)

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int dp[2010][1010];

int main()
{
    int n,k,a[2010];

    while(~scanf("%d %d",&n,&k))
    {
        for(int i = 1; i <= n; i++)
            scanf("%d",&a[i]);
        sort(a+1,a+1+n);

        memset(dp,0,sizeof(dp));

        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= i/2; j++)
            {
                if(i%2 == 0 && j == i/2)
                    dp[i][j] = dp[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]);
                else
                    dp[i][j] = min(dp[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]), dp[i-1][j]);

            }
        }
        printf("%d\n",dp
[k]);
    }
    return 0;
}