PKU 3624 Charm Bracelet

题目：http://poj.org/problem?id=3624

裸的0-1背包问题

#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;

const int maxn=12880;
const int maxm=3500;
int n, m;
int dp[maxn+10], w[maxm+10], d[maxm+10];
int main()
{
   //     freopen("in.txt", "r", stdin);
        while (scanf("%d %d", &n, &m)==2)
        {
                memset(dp, 0, sizeof(dp));
                for (int i=1; i<=n; i++) scanf("%d %d", &w[i], &d[i]);
                for (int i=1; i<=n; i++)
                {
                        for (int j=m; j>=w[i]; j--)
                        {
                                dp[j]=max(dp[j], dp[j-w[i]]+d[i]);
                        }
                }
                printf("%d\n", dp[m]);
        }
        return 0;
}