![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
背包问题
lqybzx
123
展开
-
codeforces 601E. A Museum Robbery
维护三种操作1、加入一个重量为w,价值为v的物品2、删除第k个加入的物品3、求背包容量分别为1到m时可以获得的的最大价值其中3用求和公式算出一个答案输出这题我们可以考虑cdq分治当做到区间[l,r]的时候,我们把所有起始位置r的物品加入背包这样不断迭代到某个区间[l,l]的时候就可以直接查询答案了维护哪些可以加入我是暴力传递vector的。这里可以用线段树来原创 2016-08-28 00:32:25 · 838 阅读 · 0 评论 -
hdu2844 Coins
Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in原创 2016-11-09 19:20:14 · 360 阅读 · 0 评论 -
codeforces788C The Great Mixing
Sasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentration . Today, on the party in honour of Sergiy原创 2017-05-02 20:22:05 · 528 阅读 · 0 评论 -
Petrozavodsk Winter Training Camp 2018: Carnegie Mellon U Contest I. Statistics
题目大意:有n个物品放入体积为v的背包内,问正好放满n时的最小物品数量在这个数量的基础上求a.体积平均最小b.体积中位数最小c.相同体积出现的次数最大值最小d.最大体积减去最小体积值最小题解:背包四合一,四个问题分开求解。a.直接放背包维护最小值即可。b.正反各放一遍背包,记录放进每一个时候背包的形态。放到x则将1放到x与n放到x+1的背包合并,查询原创 2018-04-28 20:01:52 · 889 阅读 · 2 评论