Welcome![Sign In][Sign Up]
Location:
Search - RMQ

Search list

[Other resourcePKU3264Source

Description: PKU3264 lineup代码 RMQ 的ST算法
Platform: | Size: 919 | Author: chenni | Hits:

[Other resource2859(AC)

Description: zoj的2859题。 2围的RMQ问题,将1围推广到2围,DP求解。
Platform: | Size: 2565 | Author: wzc | Hits:

[Other resourcermq

Description: RMQ问题是指:对于长度为n的数列A,回答若干询问RMQ(A,i,j)(i,j<=n),返回数列A中下标在[i,j]里的最小值下标。
Platform: | Size: 795 | Author: childe | Hits:

[Data structsPKU3264Source

Description: PKU3264 lineup代码 RMQ 的ST算法-PKU3264 lineup code RMQ the ST algorithm
Platform: | Size: 1024 | Author: chenni | Hits:

[Data structs2859(AC)

Description: zoj的2859题。 2围的RMQ问题,将1围推广到2围,DP求解。
Platform: | Size: 3072 | Author: wzc | Hits:

[Data structsrmq

Description: RMQ问题是指:对于长度为n的数列A,回答若干询问RMQ(A,i,j)(i,j<=n),返回数列A中下标在[i,j]里的最小值下标。-RMQ problem is that: For the length n of the series A, in answer to several asked RMQ (A, i, j) (i, j <= n), the return of series A in the subscript in [i, j] where the minimum under the subscript.
Platform: | Size: 1024 | Author: childe | Hits:

[Mathimatics-Numerical algorithmsST

Description: RMQ问题。。 不用线段树实现。 ST算法运用的是动态规划和二进制优化的思想。使得编程复杂度降低了很多很多。-RMQ problem. . Needless to achieve segment tree. ST algorithm used is a dynamic planning and optimization of binary thinking. Makes programming reduces the complexity of many.
Platform: | Size: 1024 | Author: 方宇浩 | Hits:

[Data structsSparse_Table_algorithm

Description: RMQ的sparse table算法的实现,对ACM竞赛队员非常有研究价值:)-RMQ the sparse table algorithm implementation, ACM contest for team members have research value is :)
Platform: | Size: 1024 | Author: 诗苇 | Hits:

[Data structsLCA

Description: 最近公共祖先(LCA),转化为 RMQ 用线段树解决-Recent public ancestor (LCA), into the tree line used to solve RMQ
Platform: | Size: 1024 | Author: liziyu | Hits:

[Data structsRMQ

Description: RMQ的st算法,两道题,一个是一维的,一个是二维的-RMQ the st algorithm, two questions, one is one-dimensional, and one is two-dimensional
Platform: | Size: 28672 | Author: shuangyu | Hits:

[Data structsrmq

Description: Structure rsq(range sum query) help to find sum on segment l and r O(log(l-r+1)) and update O(logN)
Platform: | Size: 107520 | Author: ODDI | Hits:

[Data structsrsq

Description: Structure rmq(range minimum or maximum query) help to find minimum or maximum on segment l and r O(log(l-r+1)) and update O(logN)
Platform: | Size: 107520 | Author: ODDI | Hits:

[Mathimatics-Numerical algorithmsRMQ

Description: RMQ算法,静态查找区间的最值!高效,快速!
Platform: | Size: 6144 | Author: 常迪 | Hits:

[AlgorithmRMQ

Description: The template of Range Minimum Query algorithm. The time complexity of this algorithm is O(N*logN).
Platform: | Size: 1024 | Author: lkq | Hits:

[AlgorithmSA-LCP

Description: This code shows you how to create a suffix array and how to use RMQ algorithm to get two suffix s longest common prefix.
Platform: | Size: 2048 | Author: lkq | Hits:

[Delphi VCLRMQ_jim

Description: O(n)实现RMQ的算法,一般RMQ问题 到 O(n)构造笛卡尔树 到 <O(n), O(1)>的求解±1 RMQ问题 -implement the data structure of RMQ in O(n) time
Platform: | Size: 1024 | Author: 曹竹 | Hits:

[AlgorithmRMQ.cpp

Description: This code s about Range Minimum Query algorithm-This code s about Range Minimum Query algorithm!!
Platform: | Size: 1024 | Author: Tuan Nguyen | Hits:

[Data structsrmq

Description: 树状数组的总结 -rmq算法. 用树状数组实现离线rmq-rmq algorithm
Platform: | Size: 1024 | Author: lostoy | Hits:

[Data structsrmq

Description: 经典RMQ问题,用来实现区间最大值和最小值的统计,预处理时间nlogn,查询时间O(1)-Classic the RMQ question, is used to achieve the interval maximum value and the minimum statistics, pretreatment time nlogn, query time O (1)
Platform: | Size: 1024 | Author: 朱铖恺 | Hits:

[Data structsoffline-linear-RMQ

Description: 离线的线性RMQ算法模板,是很好的最值提取算法。-Offline linear RMQ algorithm template is a good best value extraction algorithms.
Platform: | Size: 1024 | Author: taoistly | Hits:
« 12 »

CodeBus www.codebus.net