01背包（当容量较大）

最新推荐文章于 2021-07-25 17:11:39 发布

别动我的白羊毛

最新推荐文章于 2021-07-25 17:11:39 发布

阅读量977

点赞数 1

分类专栏： dp

本文链接：https://blog.csdn.net/yz467796454/article/details/80214745

版权

博客探讨了在背包容量极大的情况下，如何解决01背包问题。内容指出，当容量达到10的8次方时，传统的直接01背包算法会导致内存超出。

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

题目描述

It’s universally acknowledged that there’re innumerable trees in the campus of HUST.
Now HUST got a big land whose capacity is C to plant trees. We have n trees which could be plant in it. Each of the trees makes HUST beautiful which determined by the value of the tree. Also each of the trees have an area cost, it means we need to cost c _i area of land to plant.
We know the cost and the value of all the trees. Now HUSTers want to maximize the value of trees which are planted in the land. Can you help them?

输入描述:

There are multiple cases.
The first line is an integer T(T≤10), which is the number of test cases.
For each test case, the first line is two number n(1≤n≤100) and C(1≤C≤10⁸), the number of se