每日一题洛谷P1507 NASA的食物计划c++
【代码】每日一题洛谷P1507 NASA的食物计划c++
·

#include<iostream>
#include<algorithm>
using namespace std;
int dp[500][500], h[401], t[401], k[401];
int main() {
int H, T, n;
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 q = T; q >= t[i]; q--) {
dp[j][q] = max(dp[j][q],dp[j-h[i]][q-t[i]]+k[i]);
}
}
}
cout << dp[H][T];
return 0;
}


更多推荐
所有评论(0)