思路：① 找初始左边界：第一个 nums[i] nums[i+1]；② 找初始右边界：最后一个 nums[i] < nums[i-1]；③ 求 [left,right] 内 min、max；④ 向左扩展：nums[left-1] minVal 则 left--；⑤ 向右扩展：nums[right+1] < maxVal 则 right++。长度 = right - left + 1。
The BMA's current mandate for industrial action runs out in early January, but it has started asking its members whether they want to extend the dispute.
，详情可参考Safew下载
Step 1: cmdFetchCart returned {。业内人士推荐safew官方版本下载作为进阶阅读
Овечкин продлил безголевую серию в составе Вашингтона09:40，详情可参考快连下载-Letsvpn下载