![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划 背包型
文章平均质量分 87
_蓦然回首_
我们的团队具有多年Android、IOS、网站、Java开发经验,是一支充满活力,对技术充满激情的团队。
展开
-
HDU 3466 Proud Merchants
Proud Merchants Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 2558 Accepted Submission(s): 1053 Problem Description Recently,原创 2014-08-07 19:50:14 · 807 阅读 · 0 评论 -
UVa 11137 Ingenuous Cubrency
Problem I: Ingenuous Cubrency People in Cubeland use cubic coins. Not only the unit of currency iscalled a cube but also the coins are shaped like cubes andtheir values are cubes. Coins with values原创 2015-07-10 16:04:13 · 621 阅读 · 0 评论 -
UVa 11375 Matches
ProblemE: Matches We can make digits with matches as shown below: Given N matches, find the number of different numbers representable using the matches. We shall only make numbers greate原创 2015-07-08 09:25:18 · 838 阅读 · 0 评论 -
UVA 147 Dollars
题目链接 UVA 147 题意: 有11种钱币,每种有无限个,求选一些组成钱 s 的方法数。 分析: 完全背包,状态转移方程:dp [ j ] += dp [ j - c [ i ] ],即要想组成钱数 j 得从钱数 j - c[ i ] 加上一个价值为c[ i ] 的钱。 代码: #include #include #include using name原创 2015-08-07 21:24:10 · 336 阅读 · 0 评论 -
HDU 2602 Bone Collector
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-03-09 20:01:06 · 321 阅读 · 0 评论 -
HDU 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活 多重背包
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活 Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)原创 2016-05-10 10:49:03 · 934 阅读 · 2 评论 -
POJ 1787 Change 多重|完全背包
Charlie's Change Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3895 Accepted: 1183 Description Charlie is a driver of Advanced Cargo Movement, Ltd. Charl原创 2016-05-13 17:51:37 · 474 阅读 · 0 评论 -
POJ 1276 Cash Machine 多重背包
Cash Machine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 31470 Accepted: 11307 Description A Bank plans to install a machine for cash withdrawal. The m原创 2016-04-08 21:08:31 · 408 阅读 · 0 评论