1
class Solution:
2
    def totalSteps(self, nums: List[int]) -> int:
3
        st = []
4
        ans = 0
5
        for i in nums:
6
            t = 0
7
            while st and st[-1][0] <= i:
8
                t = max(t, st.pop()[1])
9
            x = 0
10
            if st:
11
                x = t + 1
12
            st.append([i, x])
13
            ans = max(ans, x)
14
        return ans