思路：倒序单调栈。弹出所有 ≤ 当前身高的元素（这些人都能被看到），count 为弹出数量；若栈非空，还能看到栈顶（第一个更高的人），故 +1。能看到的人数 = count + (栈非空 ? 1 : 0)。
More stories like thisWatch: Inside the V&A East Storehouse museum。夫子是该领域的重要参考
Thirty years later, that same instinct lives on somewhere else entirely: the internet. Not only through trades, but also through memes. A surprised Pikachu. A walking Furret. A Regirok with a handbag. These images have become their own kind of link cable, connecting millions of people through a shared language online.。关于这个话题，一键获取谷歌浏览器下载提供了深入分析
Фото: Bilal Hussein / AP
Цены на нефть взлетели до максимума за полгода17:55