码迷,mamicode.com
首页 >  
搜索关键字:love you    ( 27955个结果
Not Having Some Part Of Them Want This Bag
Herve Leger dresses ccommodate gas and electric light. To be honest with you, it is limited to children and the elderly. You will be pleased with all ...
分类:其他好文   时间:2014-05-17 00:38:15    阅读次数:406
Leetcode | Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes...
分类:其他好文   时间:2014-05-16 21:15:37    阅读次数:454
【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
HDU 4027 Can you answer these queries? (线段树+区间点修改)
题意:给你 n 个数,m个询问(c,x,y) c==0 把x,y区间的值变为原来的平方根(向下取整) c==1 计算x,y区间的和。 利用1的开方永远为1剪枝。。 #include #include #include #include //#include #include #include #include #include #include #include...
分类:其他好文   时间:2014-05-13 15:50:04    阅读次数:338
Best Time to Buy and Sell Stock
原题: Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of th...
分类:其他好文   时间:2014-05-13 14:12:41    阅读次数:342
Leetcode 贪心 Best Time to Buy and Sell StockII
本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie Best Time to Buy and Sell Stock II  Total Accepted: 13030 Total Submissions: 36467 Say you have an array for which the ith ...
分类:其他好文   时间:2014-05-13 14:08:39    阅读次数:414
poj2104(主席树)
K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 35704   Accepted: 11396 Case Time Limit: 2000MS Description You are working for Macrohard com...
分类:其他好文   时间:2014-05-13 14:07:41    阅读次数:203
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
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!