Фото: Александр Вильф / РИА Новости
思路：倒序单调栈。弹出所有 ≤ 当前身高的元素（这些人都能被看到），count 为弹出数量；若栈非空，还能看到栈顶（第一个更高的人），故 +1。能看到的人数 = count + (栈非空 ? 1 : 0)。
。关于这个话题，旺商聊官方下载提供了深入分析
"[There are] a lot of new faces tonight, which is quite upsetting because the more people we think we get off the streets, the more people are coming on the streets."
Riot police use teargas to disperse people gathering around wreckage of plane loaded with money from central bank