背包
文章平均质量分 83
kingsirre
fighting
展开
-
hdu2602 Bone Collector
又一道简单的01背包,套用模板就可以解决 Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , al原创 2015-08-22 09:45:08 · 252 阅读 · 0 评论 -
hdu2546饭卡
最近在看背包问题,把昨天写的一道基础背包题发一下 Problem Description 电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。 某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的原创 2015-08-22 09:23:39 · 316 阅读 · 0 评论 -
hdu5410 CRB and His Birthday
Problem Description Today is CRB's birthday. His mom decided to buy many presents for her lovely son. She went to the nearest shop with M Won(currency unit). At the shop, there are N kinds of p原创 2015-08-22 17:22:32 · 312 阅读 · 0 评论 -
完全背包
#include #include #include using namespace std; int main() { int m,n; int f[10001],w[10001],a[10001]; cin>>m>>n; for(int i=0;i cin>>w[i]>>a[i]; f[0]=0;原创 2015-08-22 20:16:53 · 247 阅读 · 0 评论