hdu 1500 Chopsticks(动态规划)
来源:互联网 发布:一搜网络 编辑:程序博客网 时间:2024/05/19 12:29
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:
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<stdio.h> #include<string.h> #include<stdlib.h> #define NN 5010 #define Min(a,b) (a>b?b:a) int set[NN]; int dp[1010][NN]; int main() { int t,k,n,i,j; scanf("%d",&t); while(t--){ scanf("%d%d",&k,&n); k +=8; for(i=n;i>=1;i--) scanf("%d",&set[i]); for(i=1;i<=k;i++){ dp[i][i*3] = dp[i-1][i*3-2] + (set[i*3-1] - set[i*3])*(set[i*3-1] - set[i*3]); for(j=i*3+1;j<=n;j++) dp[i][j] = Min(dp[i][j-1],dp[i-1][j-2] +(set[j-1] -set[j])*(set[j-1] - set[j])); } printf("%d\n",dp[k][n]); } return 0; }
0 0
- 动态规划 hdu 1500 Chopsticks
- hdu 1500 Chopsticks(动态规划)
- hdu 1500 Chopsticks 动态规划 比较经典
- HDU 1500 Chopsticks(动态规划)
- ZJU1234 Chopsticks - 动态规划
- [动态规划]Zju1234--Chopsticks
- HDU 1500 Chopsticks
- hdu 1500 chopsticks
- HDU-1500 Chopsticks DP
- HDU-OJ-1500 Chopsticks
- HDU 1500 Chopsticks(DP)
- hdu 1500 Chopsticks (dp)
- hdu Chopsticks
- !HDU 1500 Chopsticks-dp-(分组问题)
- 动态规划-hdu 2955
- hdu 动态规划
- HDU动态规划专题
- HDU 1028 动态规划
- java 第十天 面向对象
- NOIP2010解题报告
- JavaScript学习笔记7-附录(回掉函数)
- 对数组的操作
- wxpython初学者(三)
- hdu 1500 Chopsticks(动态规划)
- okio分析
- Java版本的一些问题
- 编写SQL查询,列出租住不止一套公寓的承租人
- 内省和BeanUtils框架3
- hdu 5183 Negative and Positive (NP)
- mantis 使用__基础——学籍管理系统
- vs2010+opencv3.0.0 环境配置 (以及配置技巧)
- Java 类的成员变量和方法以及构造方法