1
var totalSteps = function (nums) {
2
  let stack = [],
3
    dp = new Array(nums.length).fill(0),
4
    max = 0;
5

6
  for (let i = nums.length - 1; i >= 0; i--) {
7
    while (stack.length > 0 && nums[i] > nums[stack[stack.length - 1]]) {
8
      dp[i] = Math.max(++dp[i], dp[stack.pop()]);
9
      max = Math.max(dp[i], max);
10
    }
11
    stack.push(i);
12
  }
13
  return max;
14
};