You are given an array of integers nums and an integer k. The value of a subarray is defined as the minimum value within the subarray multiplied by its length. You need to choose a subarray where the index k is included, i.e., there exists a subarray (nums[i], nums[i+1], ..., nums[j]) such that iâ¤kâ¤j.
Return the maximum possible value of any such subarray.
Input: nums = [1, 3, 5, 2, 8], k = 2
Output: 8
Explanation:
The optimal subarray is from index 1 to index 24(inclusive), where the minimum value is 3. The value is calculated as min(3,5,2,8)×4=2×4=8.
Input: nums = [4, 6, 3, 5, 7, 8], k = 4
Output: 18
Explanation:
The optimal subarray is from index 0 to index 5 (inclusive), where the minimum value is 3. The value is calculated as =3×6=18.
Input: nums = [2, 1, 7, 3, 6], k = 1