1 solutions
-
0
#include<bits/stdc++.h> using namespace std; int H,T; int n; int h[405],t[405],K[405]; int dp[405][405]={}; int main(){ cin>>H>>T>>n; for(int i=1;i<=n;i++) cin>>h[i]>>t[i]>>K[i]; for(int i=1;i<=n;i++) for(int j=H;j>=h[i];j--) for(int k=T;k>=t[i];k--) dp[j][k]=max(dp[j][k],dp[j-h[i]][k-t[i]]+K[i]); cout<<dp[H][T]<<"\n"; return 0; }
by 军舰
- 1
Information
- ID
- 1035
- Time
- 1000ms
- Memory
- 125MiB
- Difficulty
- 4
- Tags
- # Submissions
- 45
- Accepted
- 22
- Uploaded By