FirstFT: the day's biggest stories
思路：单调递减栈，找「上一个比当前价格大的元素索引」。正序遍历，弹出所有 ≤ 当前价格的索引；跨度 = 当前索引 - 栈顶索引（栈空则为 当前索引 + 1）。
，这一点在一键获取谷歌浏览器下载中也有详细论述
Что думаешь? Оцени!
The US-based British content creator, who does not disclose his last name, says he has around 60,000 members in his server on Discord, an online chat service popular with gamers.