testSort(mergeSort, "Merge", arr, N);
思路：单调递减栈，找「上一个比当前价格大的元素索引」。正序遍历，弹出所有 ≤ 当前价格的索引；跨度 = 当前索引 - 栈顶索引（栈空则为 当前索引 + 1）。
，这一点在51吃瓜中也有详细论述
"I would definitely not call it a new normal, because I don't think it's normal," she said. "I don't think you can sustain the kind of labour market that we're in over the long term.
Москвичи пожаловались на зловонную квартиру-свалку с телами животных и тараканами18:04
Where to buy Lego Pokémon sets at a glance: