HDU1500(DP)

  
  

   
    
  
  
  
  

   
   
   
   
Chopsticks
   
   Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1356    Accepted Submission(s): 627 


   
   

    
    Problem Description
   
   
   
   

    
    In China, people use a pair of chopsticks to get food on the table, but Mr. L is a bit different. He uses a set of three chopsticks -- one pair, plus an EXTRA long chopstick to get some big food by piercing it through the food. As you may guess, the length of the two shorter chopsticks should be as close as possible, but the length of the extra one is not important, as long as it's the longest. To make things clearer, for the set of chopsticks with lengths A,B,C(A<=B<=C), (A-B)^2 is called the 'badness' of the set. 
It's December 2nd, Mr.L's birthday! He invited K people to join his birthday party, and would like to introduce his way of using chopsticks. So, he should prepare K+8 sets of chopsticks(for himself, his wife, his little son, little daughter, his mother, father, mother-in-law, father-in-law, and K other guests). But Mr.L suddenly discovered that his chopsticks are of quite different lengths! He should find a way of composing the K+8 sets, so that the total badness of all the sets is minimized. 
   
   
   
   

    
     
   
   

   
   

    
    Input
   
   
   
   

    
    The first line in the input contains a single integer T, indicating the number of test cases(1<=T<=20). Each test case begins with two integers K, N(0<=K<=1000, 3K+24<=N<=5000), the number of guests and the number of chopsticks. There are N positive integers Li on the next line in non-decreasing order indicating the lengths of the chopsticks.(1<=Li<=32000).
   
   
   
   

    
     
   
   

   
   

    
    Output
   
   
   
   

    
    For each test case in the input, print a line containing the minimal total badness of all the sets.
   
   
   
   

    
     
   
   

   
   

    
    Sample Input
   
   
   
   

    
    
     
     

      
      1
1 40
1 8 10 16 19 22 27 33 36 40 47 52 56 61 63 71 72 75 81 81 84 88 96 98 103 110 113 118 124 128 129 134 134 139 148 157 157 160 162 164
     
     
   
   
   
   

    
     
   
   
   
   

   
   

    
    Sample Output
   
   
   
   

    
    
     
     

      
      23


     
     
   
   
  
  
  
  

   
    
  
  
  
  

   
   状态转移方程的确定很重要，最小的必须是相邻的相减（在排序了的基础上）
  
  
  
  

   
   //if(3*i==n)dp[i][j]=dp[i][j-2]+(len[j]-len[j-1])^2
  
  
  
  

   
   //else dp[i][j]=min(dp[i][j-1],dp[i-1][j-2]+(len[j]-len[j-1]）^2)
  
  
  
  

   
   
#include<iostream>#include<algorithm>using namespace std;#define MAX 5000+10#define K 1000+10int dp[K][MAX];int len[MAX];int min(int a,int b){ return a<b?a:b;}bool cmp(int a,int b){ return a>b;}int main(){ int i,j,n,t,k; cin>>t; while(t--) {  cin>>k>>n;  for(i=1;i<=n;i++)   cin>>len[i];  sort(len+1,len+n+1,cmp);  memset(dp,0,sizeof(dp));  for(i=1;i<=k+8;i++)  {   dp[i][i*3]=dp[i-1][i*3-2]+(len[i*3]-len[i*3-1])*(len[i*3]-len[i*3-1]);   for(j=i*3+1;j<=n;j++)   {    dp[i][j]=min(dp[i][j-1],dp[i-1][j-2]+(len[j]-len[j-1])*(len[j]-len[j-1]));   }  }  cout<<dp[k+8][n]<<endl; // printf("%I64d\n",dp[k+8][n]); } return 0;}