洛谷P1833 樱花（混合背包）

传送门	难度
https://www.luogu.com.cn/problem/P1833	普及/提高-

这是一道混合背包板子题。使用二进制对数量有限且不为1的物品进行分割，化归为数量为1的物品。然后依据物品数为1或无限，分别按照0/1背包、完全背包进行处理。0/1背包、完全背包具体步骤不再赘述。

AC代码

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int tsh, tsm, teh, tem;
int T, n;
int v[1000005], w[1000005],flag[1000005];
int f[1005];
int cnt;


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


int main() {
	while (scanf("%d:%d %d:%d %d ", &tsh, &tsm, &teh, &tem,&n) != EOF) {
		T = (teh - tsh) * 60 + tem - tsm;
		memset(f, 0, sizeof(T + 1));
		cnt = 0;
		for (int i = 0; i < n; ++i) {
			int temt, temc, temp;
			scanf("%d%d%d", &temt, &temc, &temp);
			if (temp == 1 || temp == 0) {
				v[cnt] = temc;
				w[cnt] = temt;
				flag[cnt++] = temp;
			}
			else {
				for (int k = 1; k <= temp; k <<= 1) {
					temp -= k;
					v[cnt] = k * temc;
					w[cnt] = k * temt;
					flag[cnt++] = 1;
				}
				if (temp > 0) {
					v[cnt] = temp * temc;
					w[cnt] = temp * temt;
					flag[cnt++] = 1;
				}
			}
		}

		for (int i = 0; i < cnt; ++i) {
			if (flag[i] == 1)
				for (int j = T; j >= w[i]; --j)
					f[j] = bigger(f[j], f[j - w[i]] + v[i]);
			else
				for (int j = w[i]; j <= T; ++j)
					f[j] = bigger(f[j], f[j - w[i]] + v[i]);
		}
		printf("%d\n", f[T]);
	}
	return 0;
}