Codeforces 106C Buns 【0-1背包】

最新推荐文章于 2021-05-14 17:23:32 发布

笑着走完自己的路

最新推荐文章于 2021-05-14 17:23:32 发布

阅读量938

点赞数

分类专栏：背包 codeforces

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/50812757

版权

博客探讨了Codeforces 106C问题，涉及0-1背包的优化策略。通过使用背包算法，找到在限定面团和填充物数量下能获得最大价值的组合。提供了详细的题意解释、解决方案和AC代码。

摘要由CSDN通过智能技术生成

题目链接：Codeforces 106C Buns

Lavrenty, a baker, is going to make several buns with stuffings and sell them.

Lavrenty has n grams of dough as well as m different stuffing types. The stuffing types are numerated from 1 to m. Lavrenty knows that he has ai grams left of the i-th stuffing. It takes exactly bi grams of stuffing i and ci grams of dough to cook a bun with the i-th stuffing. Such bun can be sold for di tugriks.

Also he can make buns without stuffings. Each of such buns requires c0 grams of dough and it can be sold for d0 tugriks. So Lavrenty can cook any number of buns with different stuffings or without it unless he runs out of dough and the stuffings. Lavrenty throws away all excess material left after baking.

Find the maximum number of tugriks Lavrenty can earn.

Input
The first line contains 4 integers n, m, c0 and d0 (1 ≤ n ≤ 1000, 1 ≤ m ≤ 10, 1