hdu 1412

View Code

 1 #include <iostream>
 2 #include <stdlib.h>
 3 #include <memory.h>
 4 
 5 using namespace std;
 6 const int INF = 1000000000;
 7 int d[2005][1005];
 8 int min(int a,int b){
 9     return a<b?a:b;
10 }
11 int cmp(const void *a,const void*b){
12     return *(int *)a - *(int *)b;
13 }
14 int main(){
15     int n,k,a[2005];
16     while(~scanf("%d%d",&n,&k)){
17           for(int i=0;i<=n;i++){
18                   for(int j=0;j<=k;j++){
19                           d[i][j] = INF;
20                   }
21           }
22           for(int i=1;i<=n;i++){
23                   scanf("%d",&a[i]);
24           }
25           for(int i=0;i<=n;i++){
26                   d[i][0] = 0;
27           }
28           qsort(a,n+1,sizeof(a[0]),cmp);
29           for(int i=2;i<=n;i++){
30                   for(int j=1;j<=i/2;j++){
31                           //if(i>2*j)
32                           d[i][j] = min(d[i-1][j],d[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]));
33                           //if(i == 2*j)
34                           //d[i][j] = d[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]);
35                   }
36           }
37           printf("%d\n",d[n][k]);
38     }
39     return 0;
40 }

 

转载于:https://www.cnblogs.com/AlienForce/archive/2012/05/05/2484714.html