HDU - 5543 Pick The Sticks（01背包）

 Pick The Sticks

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 an LL length segment. And the gold sticks as segments too. There were many gold sticks with different length aiai and value vivi. 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?

Input

The first line of the input gives the number of test cases, T(1≤T≤100)T(1≤T≤100). TT test cases follow. Each test case start with two integers, N(1≤N≤1000)N(1≤N≤1000) and L(1≤L≤2000)L(1≤L≤2000), represents the number of gold sticks and the length of the container stick. NN lines follow. Each line consist of two integers, ai(1≤ai≤2000)ai(1≤ai≤2000) and vi(1≤vi≤109)vi(1≤vi≤109), represents the length and the value of the ithithgold stick.

Output

For each test case, output one line containing Case #x: y, where xx is the test case number (starting from 1) and yy is the maximum value of the gold sticks Xiu Yang could have taken.

 

题目大意：有n个金条，给出金条的长度和价值，要把金条装在容器里，容器长度为l，金条不能重叠，要求装的金条的总价值要尽可能大，问容器最多能装多少价值的金条

思路：每种金条只有一个，给出容器的容量，金条的大小和价值，要使容器里的价值最大，可以很快想到这种问题可以用01背包解决，但是不一样的是金条可以超出容器，在容器的两端可以把金条的中心放在容器的端点，也就是容器内消耗的长度只有金条的一半，可以理解为有两次折叠金条的机会（长度减半，价值不变）

如果金条长度的一半大于等于容器的总长度，那就只能摆这一个金条，放不下其他的金条，特判这种情况

dp [ i ] [ j ] [ k ]  表示前 i 个金条放入长度为 j 的容器，使用k次折叠机会的最大价值

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll long long
const int N=4020;
int l[N],v[N];
ll dp[N][3];
int main()
{
    int t=1,T;
    scanf("%d",&T);
    while(T--)
    {
        int n,m,tmp=0;
        scanf("%d%d",&n,&m);
        m*=2;
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&l[i],&v[i]);
            l[i]*=2;
            if(l[i]>=m*2) //特判只能摆这一根的情况
                tmp=max(tmp,v[i]);
        }
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++) 
            for(int j=m;j>=0;j--)
            for(int k=0;k<3;k++)
            {
                if(l[i]<=j) //如果能摆下，更新状态
                dp[j][k]=max(dp[j][k],dp[j-l[i]][k]+(ll)v[i]);
                if(k&&l[i]/2<=j) //如果能摆在两端，更新状态
                    dp[j][k]=max(dp[j][k],dp[j-l[i]/2][k-1]+(ll)v[i]);
            }
        ll ans=max(dp[m][0],dp[m][1]);
        ans=max(ans,dp[m][2]);
        ans=max(ans,(ll)tmp);
        printf("Case #%d: %lld\n",t++,ans);
    }
    return 0;
}