New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Title should be regarded as a new node #1

Closed

Ir1d opened this issue Nov 22, 2018 · 0 comments

Member

Ir1d commented Nov 22, 2018 •

edited

Loading

??? note " 例题 [经典问题 - 多重背包](https://oi-wiki.org/dp/backpack/#_3)"
    题目大意：有 $n$ 种物品，每种物品有 $a_i$ 件，购买一件这种物品的费用为 $c_i$，价值为 $v_i$。有一个容量为 $t$ 的背包，现在让你找到最优的一种方案，使得装入背包的物品的总价值最大。

/dp/optimization

The text was updated successfully, but these errors were encountered:

Ir1d closed this as completed in


      OI-wiki/remark-latex@75b3f80

This issue was closed.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment