大佬给你个赞再走吧。

#include<bits/stdc++.h> using namespace std; int h1,m1,h2,m2,n,m,w,c,p,dp[10007]; int main(){ scanf("%d:%d %d:%d %d",&h1,&m1,&h2,&m2,&n); m=(h2-h1)60-m1+m2; for(int i=1;i<=n;i++){ cin>>w>>c>>p; if(p==0||pw>=m){ for(int j=w;j<=m;j++) dp[j]=max(dp[j],dp[j-w]+c); } else if(p==1){ for(int j=m;j>=w;j--) dp[j]=max(dp[j],dp[j-w]+c); } else{ for(int k=1;p;k<<=1){ int x=min(k,p); for(int j=m;j>=wx;j--) dp[j]=max(dp[j],dp[j-wx]+c*x); p-=x; } } } cout<<dp[m]; }

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int h1, m1, h2, m2, n; char colon; cin >> h1 >> colon >> m1; cin >> h2 >> colon >> m2; cin >> n; int T_time = (h2 * 60 + m2) - (h1 * 60 + m1); vector<pair<int, int>> infItems; vector<vector<int>> multiItems; bool infinite = false; for (int i = 0; i < n; i++) { int t, c, p; cin >> t >> c >> p; if (p == 0) { if (t == 0 && c > 0) { infinite = true; } else if (t > 0) { infItems.push_back({t, c}); } } else { if (t == 0) { if (c > 0) { multiItems.push_back({0, c * p}); } } else { multiItems.push_back({t, c, p}); } } } if (infinite) { cout << 2000000000 << endl; return 0; } vector<pair<int, int>> binItems; for (const auto& item : multiItems) { if (item.size() == 2) { binItems.push_back({item[0], item[1]}); } else { int t = item[0]; int c = item[1]; int p = item[2]; int max_p = T_time / t; if (max_p <= 0) continue; p = min(p, max_p); int k = 1; while (k <= p) { binItems.push_back({t * k, c * k}); p -= k; k *= 2; } if (p > 0) { binItems.push_back({t * p, c * p}); } } } vector<int> dp(T_time + 1, 0); for (const auto& goods : binItems) { int t = goods.first; int c = goods.second; for (int j = T_time; j >= t; j--) { if (dp[j] < dp[j - t] + c) { dp[j] = dp[j - t] + c; } } } for (const auto& item : infItems) { int t = item.first; int c = item.second; for (int j = t; j <= T_time; j++) { if (dp[j] < dp[j - t] + c) { dp[j] = dp[j - t] + c; } } } cout << dp[T_time] << endl; return 0; }