<p>You are given an array of integers <code>nums</code> <strong>(0-indexed)</strong> and an integer <code>k</code>.</p>

<p>The <strong>score</strong> of a subarray <code>(i, j)</code> is defined as <code>min(nums[i], nums[i+1], ..., nums[j]) * (j - i + 1)</code>. A <strong>good</strong> subarray is a subarray where <code>i &lt;= k &lt;= j</code>.</p>

<p>Return <em>the maximum possible <strong>score</strong> of a <strong>good</strong> subarray.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,4,3,7,4,5], k = 3
<strong>Output:</strong> 15
<strong>Explanation:</strong> The optimal subarray is (1, 5) with a score of min(4,3,7,4,5) * (5-1+1) = 3 * 5 = 15. 
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,5,4,5,4,1,1,1], k = 0
<strong>Output:</strong> 20
<strong>Explanation:</strong> The optimal subarray is (0, 4) with a score of min(5,5,4,5,4) * (4-0+1) = 4 * 5 = 20.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>0 &lt;= k &lt; nums.length</code></li>
</ul>

from collections import deque

class Solution:
    def maximumScore(self, nums: List[int], k: int) -> int:
        left = right = k; maxScore = minValue = nums[k]; n = len(nums)

        while (left > 0 or right < n - 1):
            if left == 0:
                right += 1
            elif right + 1 == n:
                left -= 1
            elif nums[left - 1] <= nums[right + 1]:
                right += 1
            else:
                left -= 1

            minValue = min(minValue, nums[left], nums[right]) 
            maxScore = max(maxScore, minValue * (right - left + 1))
        
        return maxScore


"""
    def maximumScore(self, nums: List[int], k: int) -> int:
        stack = deque(); n = len(nums); res = 0

        for j in range(0, n + 1):
            while stack and (j == n or nums[stack[-1]] > nums[j]):
                height = nums[stack.pop()]
                
                i = (-1 if not stack else stack[-1])
                if i < k and k < j:
                    width = j - i - 1
                    res = max(res, height * width)
                
            stack.append(j)
        
        return res
"""
891