0-1背包
文章平均质量分 59
阿阿阿黄
后续文章更新:https://segmentfault.com/u/aaahuang
展开
-
hdu--2546
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16731 Accepted Submission(s): 5818Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之原创 2015-08-27 17:40:04 · 404 阅读 · 0 评论 -
0-1背包模板
0-1背包问题例:题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。解析:这是最简单的0-1背包问题,特点是:每种物品仅有一件,可以选择放或不放。0-1背包问题的特点:1.只有两种状态2.每种元素的数量为一(有时候某种元素的数量不为一,为n,但可以通过转换成n种数量为一的元素,这样就可原创 2015-10-10 20:54:22 · 426 阅读 · 0 评论 -
hdu--2955
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17016 Accepted Submission(s): 6280Problem DescriptionThe aspiring Ro原创 2015-10-10 21:25:21 · 242 阅读 · 0 评论 -
hdu-1203
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20823 Accepted Submission(s): 8318Problem DescriptionSpeakless原创 2015-10-10 21:40:38 · 468 阅读 · 0 评论 -
Fuzhou oj--福建省校赛重现
Problem C Knapsack problemAccept: 83 Submit: 457Time Limit: 3000 mSec Memory Limit : 32768 KB Problem DescriptionGiven a set of n items, each with a weight w[i] and a value v[i],原创 2015-12-27 17:55:34 · 484 阅读 · 0 评论 -
poj--2184(0-1背包,体积为负的情况)
Cow ExhibitionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10963 Accepted: 4348Description"Fat and docile, big and dumb, they look so stupid, they ar原创 2016-01-12 17:59:39 · 525 阅读 · 0 评论 -
CF--Dima and Salad
Dima and SaladTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionDima, Inna and Seryozha have gathered in a room. That's right, some原创 2016-04-01 10:48:54 · 464 阅读 · 0 评论