The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Struktur data boleh bina masa linear untuk sokongan jujukan nombor nyata O(1)-pertanyaan masa bagi segmen jumlah maksimum tempatan maksimum bagi mana-mana jujukan bersebelahan yang mengandungi sebarang kedudukan khusus dicadangkan, dengan segmen jumlah maksimum tempatan ialah segmen yang segmen jumlah maksimumnya adalah sendiri.
Yoshifumi SAKAI
Tohoku University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Yoshifumi SAKAI, "A Maximal Local Maximum-Sum Segment Data Structure" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1541-1542, September 2018, doi: 10.1587/transfun.E101.A.1541.
Abstract: A linear-time constructible data structure for a real number sequence supporting O(1)-time queries of the maximal local maximum-sum segment of any contiguous subsequence containing any specific position is proposed, where a local maximum-sum segment is a segment whose maximum-sum segment is itself.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1541/_p
Salinan
@ARTICLE{e101-a_9_1541,
author={Yoshifumi SAKAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Maximal Local Maximum-Sum Segment Data Structure},
year={2018},
volume={E101-A},
number={9},
pages={1541-1542},
abstract={A linear-time constructible data structure for a real number sequence supporting O(1)-time queries of the maximal local maximum-sum segment of any contiguous subsequence containing any specific position is proposed, where a local maximum-sum segment is a segment whose maximum-sum segment is itself.},
keywords={},
doi={10.1587/transfun.E101.A.1541},
ISSN={1745-1337},
month={September},}
Salinan
TY - JOUR
TI - A Maximal Local Maximum-Sum Segment Data Structure
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1541
EP - 1542
AU - Yoshifumi SAKAI
PY - 2018
DO - 10.1587/transfun.E101.A.1541
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2018
AB - A linear-time constructible data structure for a real number sequence supporting O(1)-time queries of the maximal local maximum-sum segment of any contiguous subsequence containing any specific position is proposed, where a local maximum-sum segment is a segment whose maximum-sum segment is itself.
ER -