背包
Lngxling
这个作者很懒,什么都没留下…
展开
-
HDU - 1176 免费馅饼 —— 01背包
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53117 Accepted Submission(s): 18646Problem Description都说天上不会掉馅饼,但有一天gameb原创 2017-09-28 12:18:25 · 205 阅读 · 0 评论 -
HDU - 2084 数塔 —— 01背包
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47197 Accepted Submission(s): 28003Problem Description在讲述DP算法的时候,一个经典的例子就是数原创 2017-09-28 12:11:48 · 256 阅读 · 0 评论 -
HDU - 2571 命运 —— 01背包
命运Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20531 Accepted Submission(s): 7144Problem Description穿过幽谷意味着离大魔王lemon已经无限接近原创 2017-09-28 12:07:40 · 299 阅读 · 0 评论 -
POJ - 1276 Cash Machine —— 多重背包 二进制优化
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37257 Accepted: 13486DescriptionA Bank plans to install a machine for cash withdrawal. The原创 2017-09-28 11:20:50 · 244 阅读 · 0 评论 -
背包板子总结
01背包int V;//背包最大容量int w[max_],v[max_];//v为价值 w为重量int dp[max_];for(i=1;i<=n;i++){ for(j=V;j>=w[i];j--) dp[j]=max(dp[j],dp[j-w[i]]+v[i]);}完全背包①int V;//背包最大容量int w[max_],v[max_];//v为价值原创 2017-09-28 11:25:55 · 391 阅读 · 0 评论 -
dp——记忆化搜索——poj 1088
原题链接——poj 1088 Language:Default滑雪Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 100517Accepted: 38263DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。原创 2017-08-21 22:02:48 · 291 阅读 · 0 评论 -
POJ - 2533 Longest Ordered Subsequence —— 最长不连续上升子序列
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 55404 Accepted: 24843DescriptionA numeric sequence of ai is ordered if a1 a原创 2017-09-28 10:55:30 · 335 阅读 · 0 评论 -
UVALive - 4764 bing it——动态规划
I guess most of you played cards on the trip to Harbin, but I’m sure you have never played thefollowing card game. This card game has N rounds and 100000 types of cards numbered from 1 to100000. A原创 2017-09-10 15:35:23 · 252 阅读 · 0 评论 -
POJ - 1458 Common Subsequence —— 最长公共子序列
Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55054 Accepted: 22947DescriptionA subsequence of a given sequence is the given seque原创 2017-09-27 00:06:27 · 296 阅读 · 0 评论 -
HDU - 2602 Bone Collector —— 01背包
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 67114 Accepted Submission(s): 28017Problem DescriptionMany year原创 2017-09-26 23:54:28 · 260 阅读 · 0 评论 -
HDU - 1171 Big Event in HDU —— 多重背包转01背包
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44223 Accepted Submission(s): 15217Problem DescriptionNowada原创 2017-09-26 23:47:06 · 223 阅读 · 0 评论 -
HDU - 2546 饭卡 —— 01背包
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33622 Accepted Submission(s): 11604Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,原创 2017-09-26 23:41:38 · 262 阅读 · 0 评论 -
codeforce 698A Vacations——贪心——动态规划
A. Vacationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has n days of vacations! So he decided to原创 2017-09-10 10:55:46 · 239 阅读 · 0 评论 -
ycb的ACM进阶之路——背包
描述 ycb是个天资聪颖的孩子,他的梦想是成为世界上最伟大的ACMer。为此,他想拜附近最有威望的dalao为师。dalao为了判断他的资质,给他出了一个难题。dalao把他带到一个到处都是题的oj里对他说:“孩子,这个oj里有一些不同的题,做每一道题都需要一些时间,每一题也有它自身的rp(人品值)。我会给你一段时间,在这段时间里,你可以做一些题。如果你是一个聪明的孩子,你应该可以让做题的总r原创 2017-09-06 22:45:05 · 279 阅读 · 0 评论 -
poj1276Cash Machine ——多重背包二进制优化
原题链接:poj1276 cash machineLanguage:Default Cash Machine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 36835 Accepted: 13373 DescriptionA Bank plans to install a machine for cash withd原创 2017-09-05 18:19:30 · 404 阅读 · 0 评论 -
HDU - 5748 Bellovin —— 最长上升子序列
BellovinTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2063 Accepted Submission(s): 808Problem DescriptionPeter has a sequ原创 2018-02-05 21:00:52 · 236 阅读 · 0 评论