思路：单调递减栈，找「上一个比当前价格大的元素索引」。正序遍历，弹出所有 ≤ 当前价格的索引；跨度 = 当前索引 - 栈顶索引（栈空则为 当前索引 + 1）。
当然，当 AI 能够以极低的成本、极快的速度批量生产高清图片时，大家心里其实越没底。现在网上的假图满天飞，「眼见为实」这句话早就靠不住了。如果任何人都能在一秒钟内生成一张几可乱真的照片，我们该如何分辨图片？
，这一点在51吃瓜中也有详细论述
As part of the investment, OpenAI is launching significant infrastructure partnerships with both Amazon and Nvidia. As in previous rounds, it is likely that a significant portion of the dollar amount comes in the form of services rather than cash, although the precise split was not disclosed.
FT Videos & Podcasts