背包
文章平均质量分 73
键盘上的舞者
这个作者很懒,什么都没留下…
展开
-
Codeforces544C:Writing Code(完全背包)
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every lin原创 2015-05-15 13:48:22 · 1937 阅读 · 0 评论 -
HDU1864:最大报销额(01背包)
Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类)、文具(B类)、差旅(C类),要求每张发票的总额不得超过1000元,每张发票上,单项物品的价值不得超过600元。现请你编写程序,在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。 Input测试输入包含若干测试用例。每个测试用例的第1行包含两个正数 Q原创 2013-06-05 20:46:17 · 4975 阅读 · 2 评论 -
HUNNU11405:Fundraised(完全背包)
Guess what?! Dalia won the money (an amount X), and now it’s time to spend it. Mohamed Fouad isthe deputy regional contest director and he wants to spend the money but he doesn’t know what tos原创 2013-10-08 23:43:03 · 1785 阅读 · 0 评论 -
HUNNU11392:Candy Store (完全背包)
http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=11392&courseid=0You are walking with a friend, when you pass a candy store. You make a comment abouthow unhealthy their wares are. You原创 2013-10-06 22:53:32 · 1633 阅读 · 1 评论 -
CSU1326: The contest(并查集+分组背包)
Description 殷犇有很多队员。他们都认为自己是最强的,于是,一场比赛开始了~ 于是安叔主办了一场比赛,比赛有n个题目,每个题目都有一个价值Pi和相对能力消耗Wi,但是有些题目因为太坑不能同时做出来,并且坑题具有传递性。(a和b一起做会坑、b和c会坑则a和c也会坑) ACM队员们想知道,于是他们想知道在能力范围内,它们最多可以作出多少价值的题目。 聪明的你原创 2013-10-03 21:34:12 · 1710 阅读 · 0 评论 -
HDU1203:I NEED A OFFER!(01背包)
Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得原创 2013-09-06 21:25:24 · 3780 阅读 · 0 评论 -
HDU1561:The more, The Better(树形DP+01背包)
Problem DescriptionACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因,有些城堡不能直接攻克,要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗? Input每个测试实例首先包括2个整数,N,M.(原创 2013-08-09 10:58:15 · 2430 阅读 · 0 评论 -
POJ3260:The Fewest Coins(混合背包)
DescriptionFarmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e., the原创 2013-07-26 22:47:33 · 2893 阅读 · 0 评论 -
POJ1742:Coins(多重背包)
DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice wat原创 2013-07-27 10:42:24 · 5372 阅读 · 3 评论 -
POJ1276:Cash Machine(多重背包)
DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominatio原创 2013-07-25 20:18:31 · 8030 阅读 · 1 评论 -
POJ1787:Charlie's Change(记录路径的多重背包)
DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a lot and so he often buys coffee at coffee vending machines at motorests. Charlie hates change. That is basically the原创 2013-07-25 16:36:51 · 2885 阅读 · 1 评论 -
POJ1276:Cash Machine(多重背包)
DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominatio原创 2013-12-07 21:14:52 · 1634 阅读 · 0 评论 -
HDU4501:小明系列故事——买年货(三重背包)
Problem Description 春节将至,小明要去超市购置年货,于是小明去了自己经常去的都尚超市。 刚到超市,小明就发现超市门口聚集一堆人。用白云女士的话说就是:“那家伙,那场面,真是人山人海,锣鼓喧天,鞭炮齐呤,红旗招展。那可真是相当的壮观啊!”。好奇的小明走过去,奋力挤过人群,发现超市门口贴了一张通知,内容如下: 值此新春佳节来临之际,为了回馈广大顾客的支持和原创 2014-02-26 21:28:46 · 2645 阅读 · 0 评论 -
CSU1613: Elephants(分组背包)
DescriptionZuosige always has bad luck. Recently, he is in hospital because of pneumonia. While he is taking his injection, he feels extremely bored. However, clever Zuosige comes up with a new ga原创 2015-05-10 19:51:41 · 1039 阅读 · 0 评论 -
HDU2126:Buy the souvenirs
Problem DescriptionWhen the winter holiday comes, a lot of people will have a trip. Generally, there are a lot of souvenirs to sell, and sometimes the travelers will buy some ones with pleasure. N原创 2014-12-10 16:21:15 · 1267 阅读 · 0 评论 -
ZOJ3524:Crazy Shopping(拓扑排序+完全背包)
Because of the 90th anniversary of the Coherent & Cute Patchouli (C.C.P), Kawashiro Nitori decides to buy a lot of rare things to celebrate.Kawashiro Nitori is a very shy kappa (a type of wate原创 2014-12-15 22:45:48 · 2159 阅读 · 1 评论 -
ZOJ3623:Battle Ships(完全背包)
Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which has L longevity. The player has a military factory, which can produce N kinds of batt原创 2014-12-15 22:39:06 · 1865 阅读 · 0 评论 -
ZOJ3662:Math Magic(完全背包)
Yesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you know, LCM (Least common multiple) of two positive numbers can be solved easily because of a * b = GCD (a, b) * LCM (a, b).原创 2014-12-15 22:57:55 · 1974 阅读 · 0 评论 -
HDU2126:Buy the souvenirs(01)
Problem DescriptionWhen the winter holiday comes, a lot of people will have a trip. Generally, there are a lot of souvenirs to sell, and sometimes the travelers will buy some ones with pleasure. N原创 2014-11-30 10:48:41 · 1533 阅读 · 0 评论 -
POJ2923:Relocation(状态压缩+01)
DescriptionEmma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they onl原创 2014-08-02 16:47:51 · 2037 阅读 · 0 评论 -
POJ1837:Balance(01背包)
DescriptionGigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance. It orders two arms of negligible weight and each arm's lengt原创 2014-08-02 15:25:33 · 1436 阅读 · 0 评论 -
XTU1198:Candy(背包)
题目描述Henry和Lena最近买了很多各种各样的糖…他们决定把所有糖分了… 但是两个人都不希望自己糖的总重量比对方少太多, 鉴于不同的糖的味道不尽相同,所以每个糖都有一个yummy值。 Henry希望知道在两人得到的糖总质量差不大于m的时候,自己的糖yummy值之和的尽量大。输入有多组数据 每组数据第一行为两个整数,n,m,(1 输出每行输出一组数据的结果原创 2014-05-19 00:35:19 · 1320 阅读 · 0 评论 -
POJ2184:Cow Exhibition(变种01背包)
Description"Fat and docile, big and dumb, they look so stupid, they aren't muchfun..." - Cows with Guns by Dana Lyons The cows want to prove to the public that they are both smart and fun.原创 2014-03-01 21:44:02 · 6092 阅读 · 2 评论 -
POJ3181:Dollar Dayz(完全背包)
DescriptionFarmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer Joh原创 2013-07-24 21:36:37 · 4947 阅读 · 0 评论 -
HDU1963 && POJ2063:Investment(完全背包)
Problem DescriptionJohn never knew he had a grand-uncle, until he received the notary’s letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that原创 2013-07-24 15:56:14 · 3182 阅读 · 0 评论 -
HDU1059 && POJ1014 :Dividing(多重背包)
Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the m原创 2013-07-24 10:52:17 · 6224 阅读 · 3 评论 -
HDU3496:Watch The Movie(二维01背包)
Problem DescriptionNew semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. She like watch cartoon very much. So she want原创 2013-06-06 00:48:42 · 3255 阅读 · 3 评论 -
HDU1171:Big Event in HDU(01背包)
Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Softwar原创 2013-06-05 22:25:13 · 10989 阅读 · 3 评论 -
HDU1976:A Mini Locomotive
DescriptionA train has a locomotive that pulls the train with its many passenger coaches. If the locomotive breaks down, there is no way to pull the train. Therefore, the office of railroads decided原创 2013-06-09 19:24:54 · 1774 阅读 · 0 评论 -
HDU1114 &&POJ1384:Piggy-Bank(完全背包)
Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The原创 2013-06-07 15:40:56 · 8549 阅读 · 3 评论 -
HDU2063:Investment(完全背包)
DescriptionJohn never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John wa原创 2013-06-09 19:14:39 · 3085 阅读 · 1 评论 -
HDU2955:Robberies(01背包)
Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to原创 2013-04-14 21:22:55 · 1538 阅读 · 0 评论 -
HDU2546:饭卡(01背包)
Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的余额,问最少可使卡上的余额为多少。 In原创 2013-04-12 14:27:00 · 1550 阅读 · 0 评论 -
POJ3624:Charm Bracelet【01背包】
DescriptionBessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from theN (1 ≤N ≤ 3,402) available charms. Eac原创 2013-04-16 15:28:31 · 4124 阅读 · 0 评论 -
HDU2602:Bone Collector(01背包)
Problem DescriptionMany 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 , also he went to the grave原创 2013-04-11 22:48:03 · 1216 阅读 · 0 评论 -
POJ3628:Bookshelf 2【01背包】
DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.FJ has N cows (1原创 2013-04-16 16:30:01 · 1435 阅读 · 0 评论 -
HDU3466:Proud Merchants(01背包)
Problem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very原创 2013-06-06 01:19:37 · 2972 阅读 · 0 评论 -
HDU4508:湫系列故事——减肥记I(完全背包)
Problem Description 对于吃货来说,过年最幸福的事就是吃了,没有之一! 但是对于女生来说,卡路里(热量)是天敌啊! 资深美女湫湫深谙“胖来如山倒,胖去如抽丝”的道理,所以她希望你能帮忙制定一个食谱,能使她吃得开心的同时,不会制造太多的天敌。 当然,为了方便你制作食谱,湫湫给了你每日食物清单,上面描述了当天她想吃的每种食物能带给她的幸福程度,以及会增加的原创 2013-06-07 15:04:42 · 2248 阅读 · 0 评论 -
HDU2159:FATE(二维完全背包)
Problem Description最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感,但又不得不通过杀怪来升完这最后一级。现在的问题是,xhd升掉最后一级还需n的经验值,xhd还留有m的忍耐度,每杀一个怪xhd会得到相应的经验,并减掉相应的忍耐度。当忍耐度降到0或者0以下时,xhd就不会玩这游戏。xhd还说了他最多只杀s原创 2013-07-23 15:48:51 · 4106 阅读 · 0 评论 -
POJ2392:Space Elevator(多重背包)
DescriptionThe cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to原创 2013-07-26 10:23:54 · 3877 阅读 · 2 评论