Sum of Subarray Minimums

Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr.

Input

  • weights: an array of integers

Output

the sum of subarray minimums

Examples

Example 1:

Input:

1weights = [1, 3, 2]

Output: 10

Explanation:

SubarrayMin Weight
1 ,3, 21
1, 3, 23
1, 3, 22
1, 3, 21
1, 3, 22
1, 3, 21

The the sum of subarray minimums is 1+3+2+1+2+1=10.

Try it yourself

Solution

Title

Script

Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.

Contrary to popular belief, Lorem Ipsum is not simply random text.

1  >>> a = [1, 2, 3]
2  >>> a[-1]
3  3

Get premium for instant access to all content and solutions

Upgrade