HDU1500 Chopsticks
来源:互联网 发布:java数据源是什么 编辑:程序博客网 时间:2024/05/23 00:25
Chopsticks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1395 Accepted Submission(s): 648
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.
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
11 401 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
23NoteFor 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
Source
OIBH Reminiscence Programming Contest
Recommend
xhd
解题思路:本题为动态规划题目,思路与《搬寝室http://blog.csdn.net/lsh670660992/article/details/9569525》差不多。
解题思路:本题为动态规划题目,思路与《搬寝室http://blog.csdn.net/lsh670660992/article/details/9569525》差不多。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int dp[1010][5008];int main(){ int ch[5008]; int t,k,n; int i,j; scanf("%d",&t); while(t--) { scanf("%d%d",&k,&n); for(i=n;i>=1;i--) scanf("%d",&ch[i]); k+=8; //sort(ch+1,ch+1+n); for(j=1;j<=k;j++) { dp[j][j*3]=dp[j-1][j*3-2]+(ch[j*3-1]-ch[j*3])*(ch[j*3-1]-ch[j*3]); for(i=3*j+1;i<=n;i++) dp[j][i]=dp[j][i-1]<(dp[j-1][i-2]+(ch[i]-ch[i-1])*(ch[i]-ch[i-1]))?dp[j][i-1]:(dp[j-1][i-2]+(ch[i]-ch[i-1])*(ch[i]-ch[i-1])); } printf("%d\n",dp[k][n]); } return 0;}
- HDU1500 Chopsticks
- hdu1500
- Chopsticks
- Chopsticks
- Chopsticks
- HDU1500(DP)
- hdu1500 动态规划
- 10271 - Chopsticks
- 10271 - Chopsticks
- hdu Chopsticks
- uva10271 - Chopsticks
- zoj1234 Chopsticks
- UVA10271- Chopsticks
- UVA10271【Chopsticks】
- 10271 - Chopsticks
- ZOJ1234 Chopsticks
- Chopsticks UVA
- ZJU1234 Chopsticks - 动态规划
- 动态链表
- HDU4414:Finding crosses
- HDU1421 搬寝室
- 利用虚函数实现多态性
- STM32的USB例程修改步骤
- HDU1500 Chopsticks
- 2013腾讯编程马拉松初赛第〇场(3月20日)HDOJ 4504 威威猫系列故事——篮球梦
- 枚举排列球的取出方式
- HDU-1024
- MP3格式文件以及编解码
- 使用Camtasia Player录制多媒体教学视频
- Ural 1100. Final Standings 桶排序
- 基于STM32的USB枚举过程学习笔记(一)
- Python常用类库TOP