P1833 樱花(完全背包+多重背包)

P1833 樱花https://www.luogu.com.cn/problem/P1833这一题就是完全背包与多重背包一起，但做到这题的时候也学到了另一种多重背包嘻嘻。

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))



#if 0
int n, m;
int v[MAXN];
int w[MAXN];
int l[MAXN];
int dp[MAXN];
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d %d", w + i, v + i, l + i);
	}
	for (int i = 1; i <= n; i++) {
		int rec = l[i];
		for (int k = 1; k <= rec; rec -= k, k *= 2) {
			for (int j = m; j >= k * w[i]; j--) {
				dp[j] = max(dp[j], dp[j - k * w[i]] + v[i] * k);
			}
		}
		for (int j = m; j >= w[i]*rec; j--) {
			dp[j] = max(dp[j], dp[j - rec * w[i]] + rec * v[i]);
		}
	}
	printf("%d", dp[m]);
	return 0;
}
#endif


int n;
int h1, m1, h2, m2;
int p[MAXN];
int c[MAXN];
int t[MAXN];
int dp[MAXN];
int main() {
	scanf("%d:%d %d:%d", &h1, &m1, &h2, &m2);
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d %d", t + i, c + i, p + i);
	}
	int tim = h2 * 60 + m2 - h1 * 60 - m1;
	for (int i = 1; i <= n; i++) {
		int rec = p[i];
		if (rec == 0) {
			for (int j = t[i]; j <= tim; j++) {
				dp[j] = max(dp[j], dp[j - t[i]] + c[i]);
			}
		} else {
			for (int k = 1; k <= rec; rec -= k, k *= 2) {
				for (int j = tim; j >= k * t[i]; j--) {
					dp[j] = max(dp[j], dp[j - k * t[i]] + k * c[i]);
				}
			}
			for (int j = tim; j >= rec * t[i]; j--) {
				dp[j] = max(dp[j], dp[j - rec * t[i]] + rec * c[i]);
			}
		}
	}
	printf("%d", dp[tim]);
	return 0;
}