Thanks for signing up!
暴力做法是对每个位置向右扫描找第一个更大值，O(n²)。可抽象为：元素像一排人，身高为数值。当前人「下一个更大」= 他右侧第一个没被挡住的人（比当前矮的都被挡住）。单调栈用 O(n) 维护「右侧候选更大值」：倒序遍历，弹掉 ≤ 当前的，栈顶即答案，再入栈当前值。
，这一点在safew官方版本下载中也有详细论述
Important Routing Notes
I love being a parent. The thing I find most fascinating about the experience is how it throws a mirror not just on one’s own childhood, but on all of human nature. It’s an obvious point, but one that I never thought about before having kids: all newborn babies are always the same, everywhere. And then, slowly but surely, they become not the same. As cultural and family influences accumulate like sedimentary layers in these tiny personalities, you can see nurture reshaping nature in a deeply embodied, physical way.