zoukankan      html  css  js  c++  java
  • Chopsticks_DP

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 2014    Accepted Submission(s): 954


    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 Note For the sample input, a possible collection of the 9 sets is: 8,10,16; 19,22,27; 61,63,75; 71,72,88; 81,81,84; 96,98,103; 128,129,148; 134,134,139; 157,157,160
     
    #include<iostream>
    #include<string.h>
    #include<stdio.h>
    #include<algorithm>
    #include<stdlib.h>
    using namespace std;
    const int inf=0x7777777;
    const int N=5050;
    int a[N],dp[1060][N];
    
    int min(int a,int b)
    {
        return a<b?a:b;
    }
    
    int main()
    {
        int n,m,t;
        scanf("%d",&t);
        while(t--)
        {
           scanf("%d%d",&m,&n);
            m+=8;
            for(int i=n;i>=1;i--)
            {
               scanf("%d",&a[i]);
            }
    
            for(int i=1;i<=m;i++)
            {
                int j=i*3;
                dp[i][j]=dp[i-1][j-2]+(a[j-1]-a[j])*(a[j-1]-a[j]);
                for(int k=j+1;k<=n;k++)
                {
                    dp[i][k]=min(dp[i][k-1],dp[i-1][k-2]+(a[k-1]-a[k])*(a[k-1]-a[k]));
                }
            }
           printf("%d
    ",dp[m][n]);
        }
    
        return 0;
    }
  • 相关阅读:
    PHP新建文件并写入内容demo
    PHP输出结果demo
    网站顶部图标使用分析
    .htaccess文件的创建 / 联动天下空间伪静态(isapi_rewrite)配置方法
    【原创】网站底部竖线布局对比/研究
    JS判断访问设备终端PC/iPad/iPhone/android 和浏览器IE/Opera/Firefox/webKit
    我的blog风格
    2020.11.17 近日复健情况
    南风又起,锦字题予往昔(写给校刊《我们大多数》)
    【对拍大法好!!】
  • 原文地址:https://www.cnblogs.com/iwantstrong/p/5756217.html
Copyright © 2011-2022 走看看