01背包 on 111qqz's blog

(dp专题006)hdu 2602 Bone Collector（01背包）

Wed, 16 Nov 2016 07:28:33 +0000

题目链接

题意:容量为V的背包，n个骨头，给出价值和体积，问最多能装多少价值的背包。

[dp专题005]hdu 1864最大报销额（01背包，垃圾题）

Wed, 16 Nov 2016 07:04:20 +0000

hdu1864题目链接

题意：中文题目，不多说了。

思路：正解是01背包，呵呵呵。

出题人是傻逼吗？

(dp专题004)hdu 2955Robberies（01背包变形）

Tue, 15 Nov 2016 11:19:56 +0000

题目链接

题意：给出n个银行，以及抢劫每个银行可以得到的价值和被抓的概率，不同银行之间被抓的概率是相互独立的，现在给出安全概率p，只有当概率从小于安全概率时才是安全的，问最多能抢劫多少价值。

BZOJ 3407: [Usaco2009 Oct]Bessie's Weight Problem 贝茜的体重问题(01背包)

Thu, 14 Apr 2016 11:39:25 +0000

3407: [Usaco2009 Oct]Bessie’s Weight Problem 贝茜的体重问题
#

Time Limit: 3 Sec Memory Limit: 128 MB Submit: 88 Solved: 79 [Submit][Status][Discuss]

BZOJ 1649: [Usaco2006 Dec]Cow Roller Coaster (dp，类似01背包)

Mon, 11 Apr 2016 09:19:52 +0000

#

Time Limit: 5 Sec Memory Limit: 64 MB Submit: 504 Solved: 265 [Submit][Status][Discuss]

Description
#

The cows are building a roller coaster! They want your help to design as fun a roller coaster as possible, while keeping to the budget. The roller coaster will be built on a long linear stretch of land of length L (1 <= L <= 1,000). The roller coaster comprises a collection of some of the N (1 <= N <= 10,000) different interchangable components. Each component i has a fixed length Wi (1 <= Wi <= L). Due to varying terrain, each component i can be only built starting at location Xi (0 <= Xi <= L-Wi). The cows want to string together various roller coaster components starting at 0 and ending at L so that the end of each component (except the last) is the start of the next component. Each component i has a “fun rating” Fi (1 <= Fi <= 1,000,000) and a cost Ci (1 <= Ci <= 1000). The total fun of the roller coster is the sum of the fun from each component used; the total cost is likewise the sum of the costs of each component used. The cows’ total budget is B (1 <= B <= 1000). Help the cows determine the most fun roller coaster that they can build with their budget.

codeforces #319 B - Modulo Sum (抽屉原理，dp)

Wed, 16 Sep 2015 03:24:00 +0000

背包还是理解的不够透彻．．

因为每次都是用那个一维形式的．

这道题的做法类似01背包.

hdu 1171 Big Event in HDU （母函数，01背包）

Sat, 04 Apr 2015 14:56:00 +0000

**Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26534 Accepted Submission(s): 9332 **

Problem Description

Nowadays, 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 Software College in 2002. The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).

hdu 1203 I NEED A OFFER! （01背包）

Sat, 04 Apr 2015 12:12:00 +0000

I NEED A OFFER!
#

**Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18287 Accepted Submission(s): 7320 **

hdu 2546 饭卡（01背包）

Sat, 04 Apr 2015 08:53:00 +0000

饭卡
#

**Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14225 Accepted Submission(s): 4945 **