
背包
Spark_007
Forward.
展开
-
背包(2)poj1276 Cash Machine(多重背包)
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22943 Accepted: 8038DescriptionA Bank plans to install a machine for cash withdrawal. The mach原创 2013-07-02 17:40:33 · 700 阅读 · 0 评论 -
背包问题精选(POJ3624+HDU2546+UVA624+POJ2184+HDU2639+POJ2923+HDU3466+HDU2126+UVA674+UVA147+POJ3181+POJ1787)
/* 背包问题精选 */最近在跟着WUYIQI大神练习dp和背包,这周是背包专题,有兴趣的童鞋可以点进去看看,WU神说这周的题量很“和谐”╮(╯-╰)╭18道 。。。http://acm.hust.edu.cn/vjudge/contest/view.action?cid=42402#overview不管怎样,还是很感谢WU神为我们找来这么好的题目,给我们带来这样的机会原创 2014-03-19 17:37:20 · 1688 阅读 · 1 评论 -
POJ 1948 Triangular Pastures (用所有的线段组成最大的三角形) DP || 携程员工运动会场地问题
Triangular PasturesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6336 Accepted: 2054DescriptionLike everyone, cows enjoy variety. Their current fancy原创 2014-05-19 17:46:19 · 1557 阅读 · 0 评论 -
背包(4)Hdu 1520 Anniversary party(树形背包)+ Poj 1463 Strategic game(还可以贪心来做)
Anniversary partyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2779 Accepted Submission(s): 1239Problem DescriptionThere is goi原创 2013-07-02 19:14:54 · 1151 阅读 · 0 评论 -
POJ 2392 Space Elevator (多重背包 + 思路题)
题目链接:http://poj.org/problem?id=2392Space ElevatorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7783 Accepted: 3690DescriptionThe cows are go原创 2014-04-01 22:55:39 · 899 阅读 · 0 评论 -
Hdu 1059 Dividing (多重背包)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1059DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15028 Accepted Submissio原创 2014-04-01 22:45:45 · 760 阅读 · 0 评论 -
背包(1)poj 1384||hdu 1114 Piggy-bank --- 完全背包
Piggy-BankTime Limit: 1000MS Memory Limit: 10000K DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. Th原创 2013-07-02 17:37:00 · 839 阅读 · 0 评论 -
HDU 3033 I love sneakers! (变形分组背包)
代码://分组背包,每组里都至少选一个,求取得的最大价值#include#include#includeusing namespace std;#define INF 0x3f3f3f3fint n;class node{public: int c,v;}a[15][105];int num[15],dp[15][10005];int main(){ int n,m,原创 2014-03-28 17:08:27 · 851 阅读 · 0 评论 -
Hdu 2159 FATE (二维背包)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2159 题意:给出升级需要的经验值n,剩余的忍耐度m,怪的种类k(杀死后得到的经验 和 杀死怪需要的忍耐度),杀怪的最大值s.问能否在忍耐度耗完之前得到足够的经验值来升级,如果能,输出剩余的最大忍耐度,否则输出-1。注意:剩余忍耐度可以是0,但不能是负数。所以杀一个怪,正好把忍耐度用完原创 2014-03-12 10:43:38 · 875 阅读 · 0 评论 -
Hdu1011 Starship Troopers -- 树形背包
/*题意:星河战队要去完成任务:用有限的战士去俘获尽可能多的首脑。条件和注意:1:一颗树(没有重边,没有环,没有孤立点),表示敌军的基地地图 2:一个战士可以战胜20个敌人,保证战士不重复战斗,不走回路。 3:要想抓到首脑,必须要有战士进入房间。分析:树上跑背包。*/#include#include#include#include#include原创 2013-08-27 19:14:01 · 849 阅读 · 0 评论 -
背包(5)Hdu 1561 The more, The Better(有限制的背包,分组背包)
The more, The BetterTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡原创 2013-07-02 21:26:51 · 850 阅读 · 0 评论 -
背包(3)Hdu1712 ACboy needs your help(分组背包)
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2710 Accepted Submission(s): 1390Problem DescriptionACboy ha原创 2013-07-02 17:46:53 · 946 阅读 · 0 评论 -
树形DP(3) Hdu3593 The most powerful force (泛化背包)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3593The most powerful forceTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 938 Accepted原创 2014-02-19 15:55:05 · 1123 阅读 · 0 评论