动态规划 hdu 1500 Chopsticks
来源:互联网 发布:查看环境变量 linux 编辑:程序博客网 时间:2024/05/19 13:43
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
Solution
#include <iostream>using namespace std;#define min(a,b) (a)<(b)?(a):(b)#define sqr(a) (a)*(a)#define MAXK 1100#define MAXN 5100int t,T,i,j,k,n,a[MAXN],f[MAXN][MAXK],temp;int main(){cin>>T;for (t=1;t<=T;t++){cin>>k>>n;for (i=1;i<=n;i++) cin>>a[i];for (i=1;i<=n/2;i++){temp=a[n+1-i];a[n+1-i]=a[i];a[i]=temp;}for (i=0;i<=n;i++) f[i][0]=0;for (j=1;j<=k+8;j++){f[j*3][j]=f[j*3-2][j-1]+sqr(a[j*3]-a[j*3-1]);for (i=j*3+1;i<=n;i++)f[i][j]=min(f[i-1][j],f[i-2][j-1]+sqr(a[i]-a[i-1]));}cout<<f[n][k+8]<<endl;}return 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 动态规划
- 大数据量,海量数据 处理方法总结
- 2013.12.13
- 年底到了,大家的公司怎么样?想跳槽啊!
- spring aop4
- 大数据导入之Bulk Insert的一点总结
- 动态规划 hdu 1500 Chopsticks
- C风格字符串动态分配和撤销内存报错的问题
- 学习笔记-关于字符集ANSI
- 动态规划 hdu 1978 How many ways
- 我们坐下来好好谈谈-与内心的对话
- vim中文帮助的安装
- 1.字符串“asdf|www.baisdfa”获得字符串中‘|’之前的字符。
- 学习大纲
- java 的基础常见问题