不懂的地方

#include<bits/stdc++.h>
using namespace std;
const int N = 10010;
int dp[1010];
struct tree{
	int t,c,p;
}a[N];
int main(){
	int h1,t1,h2,t2;
	char q;
	cin>>h1>>q>>t1>>h2>>q>>t2;
	int time = (h2-h1)*60+t2-t1;
	//cout<<time<<endl;
	int n;
	cin>>n;
	for(int i = 1;i<=n;i++)cin>>a[i].t>>a[i].c>>a[i].p;
	for(int i = 1;i<=n;i++){
		if(a[i].p==0){
			for(int j = a[i].t;j<=time;j++){
				dp[j] = max(dp[j],dp[j-a[i].t]+a[i].c);
			}
		}
		else{
			for(int q = 1;q<=a[i].p;q++){
				for(int j = time;j>=a[i].t;j--){
					dp[j] = max(dp[j],dp[j-a[i].t]+a[i].c);
				}
			}
		}
	}
	int maxn = -1;
	for(int i = 0;i<=time;i++){
		maxn = max(maxn,dp[i]);
	}
	cout<<maxn;
	return 0;
} 

#include<bits/stdc++.h>
using namespace std;
const int N = 10010;
int dp[1010];
struct tree{
	int t,c,p;
}a[N];
int main(){
	int h1,t1,h2,t2;
	char q;
	cin>>h1>>q>>t1>>h2>>q>>t2;
	int time = (h2-h1)*60+t2-t1;
	//cout<<time<<endl;
	int n;
	cin>>n;
	for(int i = 1;i<=n;i++)cin>>a[i].t>>a[i].c>>a[i].p;
	for(int i = 1;i<=n;i++){
		if(a[i].p==0){
			for(int j = a[i].t;j<=time;j++){
				dp[j] = max(dp[j],dp[j-a[i].t]+a[i].c);
			}
		}
		else{
			for(int q = 1;q<=a[i].p;q++){
				for(int j = time;j>=q*a[i].t;j--){
					dp[j] = max(dp[j],dp[j-q*a[i].t]+q*a[i].c);
				}
			}
		}
	}
	int maxn = -1;
	for(int i = 0;i<=time;i++){
		maxn = max(maxn,dp[i]);
	}
	cout<<maxn;
	return 0;
}