1
# Runtime: 3127 ms (Top 12.36%) | Memory: 28.8 MB (Top 64.23%)
2
class Solution:
3
    def validSubarraySize(self, nums: List[int], threshold: int) -> int:
4
        nums = [0] + nums + [0]
5
        stack = [0]
6
        for i in range(1, len(nums)):
7
            while nums[i] < nums[stack[-1]]:
8
                tmp = nums[stack.pop()]
9
                if tmp > threshold / (i - stack[-1] - 1):
10
                    return i - stack[-1] - 1
11
            stack.append(i)
12
        return -1