poj 3624 Charm Bracelet DP 0/1 背包问题

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.

* 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

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

Source Code

Problem: 3624		
Memory: 220K		Time: 235MS
Language: C++		Result: Accepted
Source Code
#include <cstdio>
#include <cstring>

const int N = 3402+1, M = 12880+1;

//int dp[N][M];
int dp[M];
int w[N], v[N];
int n, m;

int max(int a, int b)
{
	return a>b?a:b;
}

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