思路：单调递减栈，找「上一个比当前价格大的元素索引」。正序遍历，弹出所有 ≤ 当前价格的索引；跨度 = 当前索引 - 栈顶索引（栈空则为 当前索引 + 1）。
Мерц резко сменил риторику во время встречи в Китае09:25
"I feel proud to have a venue like it in Greater Manchester."
Initially, analysts say it is likely that people who currently pay for both services could get a cheaper overall deal.
If you would like to support the GNOME foundation, who’s infrastructure and hosting GTK relies on, please donate.