思路：单调递减栈，找「上一个比当前价格大的元素索引」。正序遍历，弹出所有 ≤ 当前价格的索引；跨度 = 当前索引 - 栈顶索引（栈空则为 当前索引 + 1）。
// Share with explicit buffer management
。搜狗输入法2026对此有专业解读
Like the N-closest algorithm, the weight of each candidate is given by the inverse of its distance to the input colour. Because of this, both algorithms produce output of a similar quality, although the N-convex method is measurably faster. As with the last algorithm, more details can be found in the original paper[2].
The Formula 1 channel on Apple TVBilly Steele for Engadget
外因則是精準的捕獲。賈煜表示，「一些平台通過捕捉老年人對『家庭』『健康』『陪伴』『懷舊』等關鍵詞的偏好，定向推送內容，強化情感依賴。」中國消費者協會發布的報告顯示，「一些短視頻平台利用算法鎖定老年人推送離奇、浮誇『微短劇』，然後再以極低價格誘導其繼續觀看並默認開通免密支付，隨後按集扣費並自動播放。」