<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>

class Solution:
    def maximumScore(self, nums: List[int], k: int) -> int:
        n=len(nums)
        left = [i for i in range(n)]
        right= [i for i in range(n)]
        cands=set()
        curr=[(nums[0],0)]
        if k==0:
            cands.add(0)
        for i in range(1, n):
            x=nums[i]
            y,j = curr.pop()
            while y>x and curr:
                y,j = curr.pop()
            if y>x:
                curr=[(x,i)]
                left[i]=0
            elif y==x:
                curr.append((y,i))
                left[i]=left[j]
            elif y<x:
                curr.append((y,j))
                curr.append((x,i))
                left[i]=j+1
            if left[i]<=k and k<=i:
                cands.add(i)
            #print(curr)

        curr=[(nums[n-1],n-1)]
        if k==n-1:
            cands.add(k)
        for i in range(n-2, -1, -1):
            x=nums[i]
            y,j = curr.pop()
            while y>x and curr:
                y,j = curr.pop()
            if y>x:
                curr=[(x,i)]
                right[i]=n-1
            elif y==x:
                curr.append((y,i))
                right[i]=right[j]
            elif y<x:
                curr.append((y,j))
                curr.append((x,i))
                right[i]=j-1
            if right[i]>=k and k>=i:
                cands.add(i)

        ans = 0
        for i in cands:
            x=nums[i]
            l, r= left[i], right[i]
            if l<=k and k<=r:
                ans = max(ans, (r-l+1)*x)
        return ans
1083