Encoding nearest larger values.
Theoretical Computer Science(2018)
摘要
In nearest larger value (NLV) problems, we are given an array A[1..n] of distinct numbers, and need to preprocess A to answer queries of the following form: given any index i∈[1,n], return a “nearest” index j such that A[j]>A[i]. We consider the variant where the values in A are distinct, and we wish to return an index j such that A[j]>A[i] and |j−i| is minimized, the nondirectional NLV (NNLV) problem. We consider NNLV in the encoding model, where the array A is deleted after preprocessing.
更多查看译文
关键词
Data structures,Encoding data structures,Succinct data structures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络