码迷,mamicode.com
首页 >  
搜索关键字:maximum    ( 4142个结果
Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?2,1,?3,4,?1,2,1,...
分类:其他好文   时间:2014-06-04 19:30:13    阅读次数:230
UVA 10827 Maximum sum on a torus
算法入门经典训练指南88页练习::这道题只要把原矩阵扩大4倍,那么其跟最大子矩阵的题目就很类似,把二维转化成一维,求最大的序列和,不过这个序列的长度不能超过n。长度不能超过n? 那这道题又跟hdu 3415HDU 3415 Max Sum of Max-K-sub-sequence (单调队列) 1...
分类:其他好文   时间:2014-05-30 18:14:46    阅读次数:471
Max Points on a Line
Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line./** * Definition for a point. * struct Point { * ...
分类:其他好文   时间:2014-05-30 16:27:19    阅读次数:238
使用SwingBench测试连接数以及修改连接数和pga
使用SwingBench工具对oracle环境进行压力测试,100个用户,就提示连接数不够:后台日志报错:Errors in file /oracle/admin/dbcc/bdump/dbcc_smon_3317.trc:ORA-00018: maximum number of sessions ...
分类:Windows程序   时间:2014-05-29 15:49:46    阅读次数:847
LeetCode123:Best Time to Buy and Sell Stock III
题目: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may co...
分类:其他好文   时间:2014-05-28 22:37:18    阅读次数:327
mysql中 int(M)中M
http://dev.mysql.com/doc/refman/5.0/en/numeric-type-overview.html 这个M 就是maximum display width。那什么是maximum display width?看了下面的例子很容易说明了,注意zerofill :my.....
分类:数据库   时间:2014-05-28 04:07:12    阅读次数:314
LeedCode --- Best Time to Buy and Sell Stock
题目链接题意: find the maximum positive difference between the price on the ith day and the jth day附上代码: 1 class Solution { 2 public: 3 int maxProfit(ve...
分类:其他好文   时间:2014-05-28 03:49:45    阅读次数:307
LeetCode122:Best Time to Buy and Sell Stock II
题目: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may co...
分类:其他好文   时间:2014-05-28 00:53:26    阅读次数:338
57. 数对之差的最大值:4种方法详解与总结[maximum difference of array]
maximum/largest difference of array
分类:其他好文   时间:2014-05-26 17:07:38    阅读次数:332
理解RMQ问题和ST算法的原理
1.RMQ问题     RMQ (Range Minimum/Maximum Query):对于长度为n的数组A,回答若干询问RMQ(A,i,j)(i,jRMQ问题是指求区间最值的问题。最简单的方法,就是遍历数组直接搜索,但是这种方式时间复杂度是O(n)。对于数组长度较大,性能要求高的场景不适用。 2.ST(Sparse Table)算法 ST算法是一种更加高效的算法,以O(nlog...
分类:其他好文   时间:2014-05-25 22:28:29    阅读次数:375
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!