![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划--01背包
codancer
为信仰而战斗
展开
-
【FZU2214】Knapsack problem(经典01背包改编)
Problem 2214 Knapsack problemAccept: 837 Submit: 3249Time 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], determine ...原创 2018-04-22 18:35:41 · 286 阅读 · 0 评论 -
【ural oj 1005】Stone Pile(01背包)
1005. Stone PileTime limit: 1.0 secondMemory limit: 64 MBYou have a number of stones with known weights w1, …, wn. Write a program that will rearrange the stones into two piles such that weight differ...原创 2018-05-13 21:37:34 · 707 阅读 · 0 评论 -
【HDU 3466】Proud Merchants(01背包改编)
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 7916 Accepted Submission(s): 3317 Problem DescriptionRecently, iSea w...原创 2018-08-04 23:14:32 · 133 阅读 · 0 评论 -
【hdu oj 2546】饭卡(01背包)
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 41567 Accepted Submission(s): 14231 Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判...原创 2018-08-07 15:47:07 · 314 阅读 · 0 评论 -
【HDU 2069 】Coin Change(基础dp+完全背包)
Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money. For example, if we have 11 cents, then we can m...原创 2018-08-07 15:56:37 · 488 阅读 · 0 评论