背包问题

0-1背包
参考讲解：0-1背包讲解1和0-1背包问题讲解2

状态转换方程：dp[i][j] = max{ dp[i-1][j], dp[i-1][j-w[i]] + v[i] }

输入

4 8
2 3
3 4
4 5
5 6

输出

10

下面是C代码

#include<stdio.h>
int n, w;
int W[100] = { 0 };
int V[100] = { 0 };
int dp[100][100];

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

void solve()
{
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j <= w; j++)
		{
			if (j < W[i]) dp[i + 1][j] = dp[i][j];
			else dp[i + 1][j] = max(dp[i][j], dp[i][j - W[i]] + V[i]);
		}
	}
	printf("%d", dp[n][w]);
}

int main()
{
	int i, j;
	scanf("%d %d", &n, &w);
	for (i = 0; i <= n; i++) dp[i][0] = 0;
	for (j = 0; j <= w; j++) dp[0][j] = 0;
	for (i = 0; i < n; i++) scanf("%d %d", &W[i], &V[i]);
	solve();
	return 0;
}