码迷,mamicode.com
首页 >  
搜索关键字:collector    ( 572个结果
2639-Bone Collector II (01背包之第k优解)
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=2639 求第k优解的关键代码: 用两个数组记录两种状态(选择或不选择),并且只要记录前k次。在这两个数组中都是前k次可能的最优解。所以我们只要把这两个数组做比较,一直排到k就行了 题目代码: 1 #in ...
分类:其他好文   时间:2016-08-09 21:55:20    阅读次数:184
第29条:理解引用计数
自动引用计数(Automatic Reference Counting, ARC) 垃圾收集器: 从Mac OS X 10.8开始,“垃圾收集器”(gargae collector)已经正式废弃了。 每个对象都有个计数器,用以表示当前有多少个事物想令此对象继续存活下去。叫做“保留计数”(retain ...
分类:其他好文   时间:2016-08-09 20:23:26    阅读次数:153
基础-DP
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s ...
分类:其他好文   时间:2016-08-07 21:34:10    阅读次数:136
杭电 oj2602~(0-1背包问题)
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51417 Accepted Submission(s): 2163 ...
分类:其他好文   时间:2016-08-06 23:13:13    阅读次数:271
HDU 2602 ——背包问题
Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as d ...
分类:其他好文   时间:2016-08-06 17:18:35    阅读次数:136
HUD 2602 Bone Collector
原题链接:点击此处 思路:01背包问题,还没太懂,拿着公式用,结果过了,放这里,以后再琢磨。 源代码: #include <iostream> #include <stdio.h> #include <vector> #include <algorithm> using namespace std; ...
分类:其他好文   时间:2016-08-06 17:15:10    阅读次数:164
M - 基础DP
Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as d ...
分类:其他好文   时间:2016-08-06 12:55:40    阅读次数:165
M - 基础DP
Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as d ...
分类:其他好文   时间:2016-08-06 11:13:23    阅读次数:198
GC: CMS垃圾回收器一(英文版)
Memory Management in the Java HotSpot? Virtual Machine Concurrent Mark-Sweep (CMS) Collector For many applications, end-to-end throughput is not as im ...
分类:其他好文   时间:2016-08-05 19:24:37    阅读次数:165
bzoj4582[Usaco2016 Open]Diamond Collector
bzoj4582[Usaco2016 Open]Diamond Collector 题意: n个钻石,每个都有一个大小,现在将其装进2个盒子里,每个盒子里的钻石最大的与最小的大小不能超过k,问最多能装多少个。n最大50000。 题解: 我真傻,真的~首先对大小排序,然后找以i为左端点的可装区间,这个 ...
分类:其他好文   时间:2016-08-03 14:55:07    阅读次数:138
572条   上一页 1 ... 31 32 33 34 35 ... 58 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!