Maximum Score of a Good Subarray

arraytwo pointersbinary search

You are given an array of integers nums (0-indexed) and an integer k .

The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], ..., nums[j]) * (j - i + 1) . A good subarray is a subarray where i <= k <= j .

Return the maximum possible score of a good subarray.

Example 1

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

Example 2

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

1 <= nums.length <= 10 ^5

1 <= nums[i] <= 2 * 10 ^4

0 <= k < nums.length

😤

Hard

Difficulty

Topic Info

ModuleDSA

CategoryArray

Sub-topicTwo Pointers