许诺 • 19小时前
using namespace std;
const int MAX = 405; int dp[MAX][MAX] = {0};
int main() {
int H, T;
cin >> H >> T;
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
int hi, ti, ki;
cin >> hi >> ti >> ki;
for (int v = H; v >= hi; --v)
{
for (int w = T; w >= ti; --w)
{
dp[v][w] = max(dp[v][w], dp[v - hi][w - ti] + ki);
}
}
}
cout << dp[H][T] << endl;
return 0;
}
评论:
请先登录,才能进行评论