36 lines
812 B
C++
36 lines
812 B
C++
|
#include <algorithm>
|
||
|
|
#include <iostream>
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
const int MAX_N=10000+5;
|
||
|
|
int sh,sm,eh,em,W,n;
|
||
|
|
int w[MAX_N],v[MAX_N],c[MAX_N];
|
||
|
|
int dp[MAX_N][MAX_N];
|
||
|
|
|
||
|
|
int main(){
|
||
|
|
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
|
||
|
|
char _;
|
||
|
|
cin>>sh>>_>>sm>>eh>>_>>em>>n;
|
||
|
|
|
||
|
|
W = (eh*60+em)-(sh*60+sm);
|
||
|
|
// cout<<W<<endl;
|
||
|
|
|
||
|
|
for(int i=1;i<=n;i++){
|
||
|
|
cin>>w[i]>>v[i]>>c[i];
|
||
|
|
}
|
||
|
|
|
||
|
|
for(int i=1;i<=n;i++){
|
||
|
|
if(c[i]==0){
|
||
|
|
for(int j=w[i];j<=W;j++){
|
||
|
|
dp[i][j]=max(dp[i-1][j],dp[i][j-w[i]]+v[i]);
|
||
|
|
}
|
||
|
|
}else{
|
||
|
|
for(int j=1;j<=c[i];j++){
|
||
|
|
for(int k=1;k*w[i]<=j&&k<=c[i];k++){
|
||
|
|
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]*k]+v[i]*k);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
cout<<dp[n][W]<<endl;
|
||
|
|
}
|