码迷,mamicode.com
首页 >  
搜索关键字:uva 11827 maximum gc    ( 15683个结果
WeakReference(弱引用)
原地址:http://www.cnblogs.com/bayonetxxx/archive/2009/06/02/1494728.html我们平常用的都是对象的强引用,如果有强引用存在,GC是不会回收对象的。我们能不能同时保持对对象的引用,而又可以让GC需要的时候回收这个对象呢?.NET中提供了We...
分类:其他好文   时间:2014-05-06 08:53:36    阅读次数:317
论文相关
MATLAB绘制函数的图形.pdfhttp://gc.nuaa.edu.cn/math/data/%E6%95%B0%E5%AD%A6%E5%AE%9E%E9%AA%8C/MATLAB/2-MATLAB%E7%BB%98%E5%88%B6%E5%87%BD%E6%95%B0%E7%9A%84%E5%...
分类:其他好文   时间:2014-05-06 01:11:27    阅读次数:268
[leetcode] Best Time to Buy and Sell Stock II
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类:其他好文   时间:2014-05-06 00:51:29    阅读次数:353
Leetcode: Maximum Depth of Binary Tree
1 /** 2 * Definition for binary tree 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNo...
分类:其他好文   时间:2014-05-05 22:44:13    阅读次数:328
uva 11294
Problem E: WeddingUp to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom s...
分类:其他好文   时间:2014-05-05 22:10:59    阅读次数:373
uva 10269 最短路+dp
题意:有a个村庄、b个城镇, 编号分别为:1—a , a+1——a+b 。 有双神奇的鞋,可以瞬时移动,可以使用k次,每次可以移动L , 但穿这双鞋的时候,不能经过城镇 , 问:从a+b 到 1 最短距离是多少? 刚开始看这个题时 , 一点思路都没有 , dp类型的题目做得太少了。 解法:进行状态压缩, 用点+使用鞋子的次数 , 来表示一个状态 , d[i][k] , 表示到 ...
分类:其他好文   时间:2014-05-04 00:21:00    阅读次数:383
UVA之11462 - Age Sort
【题目】 B Age Sort Input: Standard Input Output: Standard Output   You are given the ages (in years) of all people of a country with at least 1 year of age. You kn...
分类:其他好文   时间:2014-05-03 16:51:42    阅读次数:427
UVA之11549 - Calculator Conundrum
【题目】 Problem C CALCULATOR CONUNDRUM Alice got a hold of an old calculator that can display n digits. She was bored enough to come up with the following time waster. She enters a number k t...
分类:其他好文   时间:2014-05-03 15:37:03    阅读次数:308
UVA 之10010 - Where's Waldorf?
Where's Waldorf?  Given a m by n grid of letters, ( ), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line o...
分类:其他好文   时间:2014-05-02 10:59:15    阅读次数:514
UVA 之401 - Palindromes
A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from lef...
分类:其他好文   时间:2014-05-02 10:33:09    阅读次数:332
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!