期刊
INFORMATION PROCESSING LETTERS
卷 110, 期 16, 页码 655-658出版社
ELSEVIER
DOI: 10.1016/j.ipl.2010.05.022
关键词
Algorithms; Algorithm design and analysis; Data structures
Given a sequence of n elements, we introduce the notion of an almost-increasing subsequence as the longest subsequence that can be converted to an increasing subsequence by possibly adding a value, that is at most a fixed constant, to each of the elements. We show how to optimally construct such subsequence in O(n logk) time, where k is the length of the output subsequence. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据