poj 3624 Charm Bracelet(01背包)

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 42856		Accepted: 18454

Description

Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight W_i (1 ≤ W_i ≤ 400), a 'desirability' factor D_i (1 ≤ D_i ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).

Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.

Input

* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: W_i and D_i

Output

* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

Sample Input

4 6
1 4
2 6
3 12
2 7

Sample Output

23

Source

USACO 2007 December Silver

题意：

01背包。

分析：

我用了两种写法，一种是建一个二维数组，但是如果建dp[N][M]会MLE，而每一次转移的时候，依赖的只有上一次状态，所以用dp[2][M]就行了。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int v[4000],w[4000];
int dp[2][13000];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&w[i],&v[i]);
        }
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<=m;j++)
            {
                if(j-w[i]>=0)
                    dp[i%2][j]=max(dp[(i-1)%2][j],dp[(i-1)%2][j-w[i]]+v[i]);
                else
                    dp[i%2][j]=dp[(i-1)%2][j];
            }
        }
        printf("%d\n",dp[n%2][m]);
    }
    return 0;
}

第二种写法就是建一个一维数组，因为发现每次转移的时候其实可以发现是与i无关的，只是由重量转移过来的。而对应i的前一个状态i-1的重量j是始终小于状态i的j的，所以这里需要逆序的搜索。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int v[4000],w[4000];
int dp[13000];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&w[i],&v[i]);
        }
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            for(int j=m;j>=w[i];j--)
            {
                dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}