Medium
,Array
,DP
,Stack
Given an array of integers arr, find the sum of min(b)
, where b
ranges over every (contiguous) subarray of arr
. Since the answer may be large, return the answer modulo \(10^9 + 7\) .
Constraints:
1 <= arr.length
<= \(3 * 10^4\)1 <= arr[i]
<= \(3 * 10^4\)Yen-Chi ChenFri, Nov 25, 2022 10:40 PM
DanSat, Jan 20, 2024 08:03 PM
Time: \(O(n)\)
Extra Space: \(O(n)\)
Yen-Chi ChenFri, Nov 25, 2022 10:40 PM