« 博客园首页

hdu 1003 Max sum

ion(s): 48835 Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5
琴影 2016-05-10 浏览(8)
http://www.cnblogs.com/qinduanyinghua/p/5476500.html

1689 建造高塔

3 23711 48835 21518 30524 38326 49077 6473 44323 25053 41342 36590 11419 21870 30291 20678 29368 34738 4434 35269 15948 906 46656 49845 43618 36644 38000 34666
神犇(shenben) 2016-08-16 浏览(12)
http://www.cnblogs.com/shenben/p/5777181.html

AWK“煎蛋”教程

.soa.36:48835 purchaseconfig.purchas:8016 ESTABLISHED tcp 0 0 appSt....soa.36:48835 tcp appStockWorker.soa.36:36060 tcp appStockWorker.soa.36:57039 tc
森林行走 2014-11-05 浏览(132)
http://www.cnblogs.com/yangml/p/4075305.html

中文汉字转换拼音PHP类

(35211, 48835, 17056, 22246, 31452, 33948, 51851, 44441, 48356, 49091, 45210, 29180, 61827, 49347, 23179, 26108, 44946, 45453, 31925, 54684, 21426, 41631, 27117
子海蓝心 2014-10-15 浏览(264)
http://www.cnblogs.com/851507788cto/p/4025842.html

内核 跟踪与统计工具

--- 48835 100.000 wget CPU_CLK_UNHALT...| samples| %| ------------------ 45778 93.7401 vmlinux-3.4.26-yocto-standard 1921 3.9337 libc
zengkefu 2016-07-03 浏览(11)
http://www.cnblogs.com/zengkefu/p/5637956.html