hdu 1712 ACboy needs your help(多重背包问题)

最新推荐文章于 2023-12-04 20:59:25 发布

不给糖吃就胡闹

最新推荐文章于 2023-12-04 20:59:25 发布

阅读量397

点赞数

分类专栏：动态规划文章标签：算法 c++

本文链接：https://blog.csdn.net/zhi6fui/article/details/128471445

版权

动态规划专栏收录该内容

27 篇文章 0 订阅

订阅专栏

ACboy needs your help

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12581 Accepted Submission(s): 6854

Problem Description

ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the N courses to maximize the profit?

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers N and M, N is the number of courses, M is the days ACboy has.
Next follow a matrix A[i][j], (1<=i<=N<=100,1<=j<=M<=100).A[i][j] indicates if ACboy spend j days on ith course he will get profit of value A[i][j].
N = 0 and M = 0 ends the input.

Output

For each data set, your program should output a line which contains the number of the max profit ACboy will gain.

Sample Input

2 2 1 2 1 3 2 2 2 1 2 1 2 3 3 2 1 3 2 1 0 0

Sample Output

3 4 6

思路：

本题与0-1背包相比多了组的区别。这时需要增加一个for

#include<bits/stdc++.h>
using namespace std;
const int N = 105;
int w[N][N], c[N][N];
int dp[N];
int n, m;
int main() {
	while (scanf("%d%d", &n, &m) && n && m) {
		for (int i = 1; i <= n; i++) {
			for (int k = 1; k <= m; k++) {
				scanf("%d", &w[i][k]);
				c[i][k] = k;
			}
		}
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= n; i++) { //n组
			for (int j = m; j >= 0; j--) {
				for (int k = 1; k <= m; k++) {
					if (j >= c[i][k]) {
						dp[j] = max(dp[j], dp[j - c[i][k]] + w[i][k]);
					}
				}
			}
		}
		printf("%d\n", dp[m]);
	}return 0;
}