码迷,mamicode.com
首页 >  
搜索关键字:see you again    ( 29258个结果
hust 1328 String
题目描述Give you a string S,assume the Sub-String Stri = S[0..i] and the length of the string is N. e.g. S = "moreandmorecold", N = 15, Str0 = "m" Str1 = ...
分类:其他好文   时间:2014-05-14 02:36:45    阅读次数:314
zoj Gao The Sequence
Gao The SequenceTime Limit:2 Seconds Memory Limit:65536 KBYou are given a sequence of integers,A1,A2,...,An. And you are allowed a manipulation on the...
分类:其他好文   时间:2014-05-13 19:49:14    阅读次数:277
【LeetCode】Triangle
TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given...
分类:其他好文   时间:2014-05-13 18:51:44    阅读次数:297
lost+found目录
If you runfsck, the filesystem check and repair command, it might find data fragments that are not referenced anywhere in the filesystem. In particula...
分类:其他好文   时间:2014-05-13 16:59:54    阅读次数:276
POJ 3017 单调队列dp
Cut the Sequence Time Limit: 2000MS   Memory Limit: 131072K Total Submissions: 8764   Accepted: 2576 Description Given an integer sequence { an } of length N, you are to ...
分类:其他好文   时间:2014-05-13 16:04:29    阅读次数:267
ZOJ3672:Gao The Sequence
You are given a sequence of integers, A1,A2,...,An. And you are allowed a manipulation on the sequence to transform the origin sequence into another sequence B1,B2,...,Bn(Maybe the two sequences are s...
分类:其他好文   时间:2014-05-13 13:45:10    阅读次数:327
Leetcode 贪心 Best Time to Buy and Sell Stock
本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie Best Time to Buy and Sell Stock  Total Accepted: 13234 Total Submissions: 43145 Say you have an array for which the ith ele...
分类:其他好文   时间:2014-05-13 07:30:13    阅读次数:276
ZOJ3329之经典概率DP
One Person Game Time Limit: 1 Second      Memory Limit: 32768 KB      Special Judge There is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 ha...
分类:其他好文   时间:2014-05-13 06:06:00    阅读次数:357
HDU4027 Can you answer these queries 线段树区间求和+剪枝
给了你n,然后n个数字在一个数组中,接下来m个询问,每个询问三个数字 t,x,y,若t==0,那么修改区间[x,y]的每一个值,变为原来每个位置上的数 开根号取整,若t==1,那么对区间[x,y]求和 由于n,m,很大,所以树状数组铁定超时,若直接用线段树来做区间修改,那么也是超时,这类题目没别的方法了,静心剪枝,发现题目给的数据范围为2^63,有没有发现,2^63开根号 绝对不需要开1...
分类:其他好文   时间:2014-05-12 23:01:59    阅读次数:479
显示数据库中的存储过程__转
显示数据库中的存储过程__转 It's no easy trick to see stored procedures in a database programmatically with a scripting language like ASP. If you're using MS Access, you're out of luck. Access provides no way to ...
分类:数据库   时间:2014-05-12 22:43:25    阅读次数:541
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!