码迷,mamicode.com
首页 >  
搜索关键字:you have two operati    ( 41000个结果
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
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
[ACM] 1016 Prime Ring Problem (深度优先搜索)
Prime Ring Problem Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent...
分类:其他好文   时间:2014-05-13 11:54:17    阅读次数:444
HDU3920:Clear All of Them I(状态压缩)
Problem Description Acmers have been the Earth Protector against the evil enemy for a long time, now it’s your turn to protect our home.   There are 2 * n enemies in the map. Your task is to clear a...
分类:其他好文   时间:2014-05-13 11:29:40    阅读次数:308
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!