hdu 5543
来源:互联网 发布:学生成绩管理系统软件 编辑:程序博客网 时间:2024/06/10 19:28
Pick The Sticks
Time Limit: 15000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 303 Accepted Submission(s): 111
Problem Description
The story happened long long ago. One day, Cao Cao made a special order called "Chicken Rib" to his army. No one got his point and all became very panic. However, Cao Cao himself felt very proud of his interesting idea and enjoyed it.
Xiu Yang, one of the cleverest counselors of Cao Cao, understood the command Rather than keep it to himself, he told the point to the whole army. Cao Cao got very angry at his cleverness and would like to punish Xiu Yang. But how can you punish someone because he's clever? By looking at the chicken rib, he finally got a new idea to punish Xiu Yang.
He told Xiu Yang that as his reward of encrypting the special order, he could take as many gold sticks as possible from his desk. But he could only use one stick as the container.
Formally, we can treat the container stick as anL length segment. And the gold sticks as segments too. There were many gold sticks with different length ai and value vi . Xiu Yang needed to put these gold segments onto the container segment. No gold segment was allowed to be overlapped. Luckily, Xiu Yang came up with a good idea. On the two sides of the container, he could make part of the gold sticks outside the container as long as the center of the gravity of each gold stick was still within the container. This could help him get more valuable gold sticks.
As a result, Xiu Yang took too many gold sticks which made Cao Cao much more angry. Cao Cao killed Xiu Yang before he made himself home. So no one knows how many gold sticks Xiu Yang made it in the container.
Can you help solve the mystery by finding out what's the maximum value of the gold sticks Xiu Yang could have taken?
Xiu Yang, one of the cleverest counselors of Cao Cao, understood the command Rather than keep it to himself, he told the point to the whole army. Cao Cao got very angry at his cleverness and would like to punish Xiu Yang. But how can you punish someone because he's clever? By looking at the chicken rib, he finally got a new idea to punish Xiu Yang.
He told Xiu Yang that as his reward of encrypting the special order, he could take as many gold sticks as possible from his desk. But he could only use one stick as the container.
Formally, we can treat the container stick as an
As a result, Xiu Yang took too many gold sticks which made Cao Cao much more angry. Cao Cao killed Xiu Yang before he made himself home. So no one knows how many gold sticks Xiu Yang made it in the container.
Can you help solve the mystery by finding out what's the maximum value of the gold sticks Xiu Yang could have taken?
Input
The first line of the input gives the number of test cases, T(1≤T≤100) . T test cases follow. Each test case start with two integers, N(1≤N≤1000) and L(1≤L≤2000) , represents the number of gold sticks and the length of the container stick. N lines follow. Each line consist of two integers, ai(1≤ai≤2000) and vi(1≤vi≤109) , represents the length and the value of the ith gold stick.
Output
For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the maximum value of the gold sticks Xiu Yang could have taken.
Sample Input
43 74 12 18 13 74 22 18 43 54 12 28 91 110 3
Sample Output
Case #1: 2Case #2: 6Case #3: 11Case #4: 3HintIn the third case, assume the container is lay on x-axis from 0 to 5. Xiu Yang could put the second gold stick center at 0 and put the third gold stick center at 5, so none of them will drop and he can get total 2+9=11 value. In the fourth case, Xiu Yang could just put the only gold stick center on any position of [0,1], and he can get the value of 3.
Source
The 2015 China Collegiate Programming Contest
Recommend
wange2014
#include <bits/stdc++.h>using namespace std;#define N 2000 + 10#define M 4000 + 10#define LL long longconst int mod = 1000000000 + 7;int n, T, L;struct Stick{ int a; LL v;}S[N];LL dp[2][M][3];int main(){ int kase = 0; scanf("%d", &T); while(T--){ scanf("%d%d", &n, &L); L *= 2; LL ans = 0; for(int i = 1; i <= n; i++) { scanf("%d%I64d", &S[i].a, &S[i].v); S[i].a *= 2; ans = max(ans, S[i].v); } memset(dp, 0, sizeof dp); int t = 0; for(int i = 1; i <= n; i++){ t ^= 1; for(int j = 0; j <= L; j++) for(int k = 0; k < 3; k++) dp[t][j][k] = dp[t^1][j][k]; for(int j = S[i].a/2; j <= L; j++) for(int k = 0; k < 3; k++){ if(j >= S[i].a) dp[t][j][k] = max(dp[t][j][k], dp[t^1][j-S[i].a][k]+S[i].v); if(k){ dp[t][j][k] = max(dp[t][j][k], dp[t^1][j-S[i].a/2][k-1] + S[i].v); } } } for(int i = 0; i < 2; i++) for(int k = 0; k < 3; k++) ans = max(ans, dp[i][L][k]); printf("Case #%d: %I64d\n", ++kase, ans); } return 0;}
1 0
- hdu 5543
- HDU 5543
- HDU 5543 (DP)
- HDU-5543 DP
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- spring多数据源+事物管理
- soj 2111: littleken bg
- ReactNative基础教程
- Struts 2读书笔记-----使用Struts 2的输入校验
- HDU 1813 Escape from Tetris
- hdu 5543
- activity之间的跳转与数据传递
- BZOJ 4292: [PA2015]Równanie(转换枚举)
- CSS Master, Sitepoint 2015读书笔记(印象比较深的几点:CSS优先级3元组表示法,多列及flex,Transforms)
- 创建库并上传至私有Maven
- CoordinatorLayout嵌套AppBarLayout的使用
- Python CGI
- 使用CreateThread函数创建线程
- 哈理工院赛练习题 小瑞-开心消消乐 II