<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 {
public:
    int maximumScore(vector<int>& nums, int k) {
        int n=nums.size(),maxi=0;
        vector<int> pre(n),suff(n);
        int mini=nums[k];
        for(int i=k;i>=0;i--){
            mini=min(mini,nums[i]);
            pre[i]=mini;
        }
        mini=nums[k];
        for(int i=k;i<n;i++){
            mini=min(mini,nums[i]);
            suff[i]=mini;
        }
        for(int i=0;i<n;i++){
            int left=i,right=i;
            int l=0,r=k;
            while(l<=r){
                int mid=(l+r)/2;
                if(nums[i]<=pre[mid]){
                    left=mid;
                    r=mid-1;
                }else{
                    l=mid+1;
                }
            }
            l=k,r=n-1;
            while(l<=r){
                int mid=(l+r)/2;
                if(nums[i]<=suff[mid]){
                    right=mid;
                    l=mid+1;
                }else{
                    r=mid-1;
                }
            }
            
           if(left<=k && k<=right){
                maxi=max(maxi,abs(right-left+1)*nums[i]);
           }
        }
        return maxi;
    }
};
100400