The Range Maximum Density Segment Query Problem in the Sequence
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 104 === Given a sequence A = ⟨a1, a2, ... , an⟩ of real numbers, let A(i, j) denote the segment ⟨ai, ... , aj⟩ of A. We define Sum(i; j) = ai + ai+1 + ... + aj to be the sum of segment A(i, j), and j - i + 1 to be the total width of segment A(i, j). We define the densi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85s32a |