思路：① 找初始左边界：第一个 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。
Медведев вышел в финал турнира в Дубае17:59
。heLLoword翻译官方下载是该领域的重要参考
siftDown(arr, n, i);
# memory = 2048 # MiB, default
A woman who runs a community larder said the organisation has seen a "record number" of customers and recently served 117 people in one day.