背包问题
junior19
abcde
展开
-
NYOJ289:苹果(01背包入门)
苹果 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 ctest有n个苹果,要将它放入容量为v的背包。给出第i个苹果的大小和价钱,求出能放入背包的苹果的总价钱最大值。 输入有多组测试数据,每组测试数据第一行为2个正整数,分别代表苹果的个数n和背包的容量v,n、v同时为0时结束测试,此时不输出。接下来的n行,每行2个原创 2016-12-27 13:46:43 · 316 阅读 · 0 评论 -
lightoj1125:Divisible Group Sums(类01背包)
1125 - Divisible Group Sums PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Given a list of N numbers you will be allowed to cho原创 2017-01-25 00:05:06 · 285 阅读 · 0 评论 -
HDU5188:zhx and contest(类01背包)
zhx and contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 828 Accepted Submission(s): 316 Problem Description As one of th原创 2017-01-31 00:21:41 · 283 阅读 · 0 评论 -
HDU4341:Gold miner(分组背包)
Gold miner Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2240 Accepted Submission(s): 855 Problem Description Homelesser likes原创 2017-02-01 00:50:44 · 317 阅读 · 0 评论 -
HDU1864:最大报销额(类01背包 浮点数处理)
最大报销额 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 23604 Accepted Submission(s): 7188 Problem Description 现有一笔经费可以报销一定额度的发票。允原创 2017-02-01 15:11:47 · 302 阅读 · 0 评论 -
POJ1948:Triangular Pastures(二维01背包)
detail:http://blog.csdn.net/lvshubao1314/article/details/41624239 Triangular Pastures Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 7802 Accepted: 2590原创 2017-02-01 16:54:31 · 300 阅读 · 0 评论 -
HDU3127:WHUgirls(二维完全背包)
WHUgirls Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2810 Accepted Submission(s): 1052 Problem Description There are many原创 2017-02-23 17:16:38 · 269 阅读 · 0 评论 -
HDU4381:Grid(类01背包)
Grid Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 903 Accepted Submission(s): 289 Problem Description There are n boxes in原创 2017-02-04 00:32:13 · 243 阅读 · 0 评论 -
UVA10154:Weights and Measures(类01背包)
I know, up on top you are seeing great sights, But down at the bottom, we, too, should have rights. We turtles can't stand it. Our shells will all crack! Besides, we need food. We are starving!" gr原创 2017-03-04 13:24:34 · 206 阅读 · 0 评论 -
ZSTU校赛Problem D: 买iphone(背包)
Problem D: 买iphone Time Limit: 3 Sec Memory Limit: 128 MB Submit: 825 Solved: 121 Description 自从上次仓鼠中了1000万彩票后,彻底变成了土豪了,一群人愿意认他做干爹,仓鼠决定送他的干儿子每人一部iphone。仓鼠今天带了一群人去买iphone,每个人身上都背着一个大背包,只有3种原创 2017-03-19 17:22:22 · 815 阅读 · 0 评论 -
CF544C:Writing Code(二维完全背包)
C. Writing Code time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Programmers working on a large project have原创 2017-03-23 23:14:09 · 459 阅读 · 0 评论 -
CF788C:The Great Mixing(背包bitset & bfs)
C. The Great Mixing time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Sasha and Kolya decided to get drunk wit原创 2017-04-26 14:42:30 · 596 阅读 · 0 评论 -
HDU:度度熊与邪恶大魔王(完全背包)
度度熊与邪恶大魔王 Accepts: 561 Submissions: 3397 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description 度度熊为了拯救可爱的公主,于是与邪恶大魔王战斗起来原创 2017-08-05 15:22:40 · 203 阅读 · 0 评论 -
CF864E:E. Fire(01背包 & 路径输出)
E. Fire time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Polycarp is in really serious trouble — his house i原创 2017-09-27 23:36:34 · 431 阅读 · 0 评论 -
CF19b: Checkout Assistant(类01背包)
B. Checkout Assistant time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Bob came to a cash & carry store, put原创 2017-01-24 18:07:43 · 584 阅读 · 0 评论 -
HDU5389:Zero Escape(dp & 类背包)
Zero Escape Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1578 Accepted Submission(s): 801 Problem Description Zero Escape,原创 2017-01-24 00:51:33 · 351 阅读 · 0 评论 -
HDU3236:Gift Hunting(类01背包加强版)
reference:http://blog.csdn.net/madaidao/article/details/35794835 7 口碑商家客流量预测大赛》 Gift Hunting Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others原创 2017-02-04 18:43:21 · 298 阅读 · 0 评论 -
HDU2126:Buy the souvenirs(类01背包)
Buy the souvenirs Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2188 Accepted Submission(s): 829 Problem Description When the原创 2017-01-13 21:25:48 · 237 阅读 · 0 评论 -
HDU4501:小明系列故事——买年货(类01背包多维版)
小明系列故事——买年货 Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 3314 Accepted Submission(s): 1524 Problem Description 春节将至,小明要去超市购原创 2017-02-05 22:41:23 · 302 阅读 · 0 评论 -
HDU3496:Watch The Movie(二维01背包)
Watch The Movie Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 7559 Accepted Submission(s): 2413 Problem Description New semest原创 2017-01-15 13:43:03 · 378 阅读 · 0 评论 -
UVA12563: Jin Ge Jin Qu hao(类01背包)
Problem J Jin Ge Jin Qu [h]ao (If you smiled when you see the title, this problem is for you ^_^) For those who don't know KTV, see: http://en.wikipedia.org/wiki/Karaoke_box There is原创 2017-01-15 00:37:52 · 428 阅读 · 0 评论 -
POJ2184:Cow Exhibition(类01背包)
Cow Exhibition Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12800 Accepted: 5121 Description "Fat and docile, big and dumb, they look so stupid, they原创 2017-01-14 21:15:51 · 251 阅读 · 0 评论 -
NYOJ860:又见01背包(01背包入门2)
又见01背包 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 有n个重量和价值分别为wi 和 vi 的 物品,从这些物品中选择总重量不超过 W 的物品,求所有挑选方案中物品价值总和的最大值。 1 1 1 1 输入多组测试数据。 每组测试数据第一行输入,n 和 W ,接下来有n行,每行输原创 2016-12-27 15:04:32 · 301 阅读 · 0 评论 -
HDU2159: FATE(二维完全背包)
FATE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12661 Accepted Submission(s): 5988 Problem Description 最近xhd正在玩一款叫做FATE的游戏,原创 2017-01-15 15:28:10 · 287 阅读 · 0 评论 -
HDU1709:The Balance(类01背包 & 母函数)
The Balance Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7799 Accepted Submission(s): 3230 Problem Description Now you are as原创 2017-02-05 21:04:55 · 224 阅读 · 0 评论 -
HDU1059:Dividing(多重背包二进制优化)
Dividing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24845 Accepted Submission(s): 7079 Problem Description Marsha and Bill原创 2017-01-15 17:08:12 · 301 阅读 · 0 评论 -
ZOJ3623: Battle Ships(类完全背包)
Battle Ships Time Limit: 2 Seconds Memory Limit: 65536 KB 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.原创 2017-01-17 16:49:29 · 284 阅读 · 0 评论 -
POJ3211:Washing Clothes(分组01背包)
Washing Clothes Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 9851 Accepted: 3158 Description Dearboy was so busy recently that now he has piles of cl原创 2017-01-13 00:31:17 · 286 阅读 · 0 评论 -
HDU3591:The trouble of Xiaoqian(多重背包+完全背包)
The trouble of Xiaoqian Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1977 Accepted Submission(s): 700 Problem Description In原创 2017-01-15 19:56:31 · 361 阅读 · 0 评论 -
BZOJ1042:硬币购物(背包 & 容斥)
1042: [HAOI2008]硬币购物 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 2953 Solved: 1822 [Submit][Status][Discuss] Description 硬币购物一共有4种硬币。面值分别为c1,c2,c3,c4。某人去商店买东西,去了tot次。每次带di枚ci硬币,买s i的价值原创 2017-12-26 00:24:46 · 250 阅读 · 0 评论