Tap here to switch tabs
Problem
Submissions

Problem: Range Sum of Sorted Subarray Sums

Range Sum of Sorted Subarray Sums asks you to sort the sums of every non-empty continuous subarray, then return the total of the entries between the given 1-based positions, modulo a large prime.

Statement

You are given an integer array nums containing nn positive integers along with left and right. Calculate the sum of its elements for every non-empty continuous subarray of nums. Collect these sums into a new array and sort it in nondecreasing order. This will result in a new array of size n×(n+1)/2n \times (n + 1) /2.

Your task is to return the sum of the elements in this sorted array from the index left to right (inclusive with 1-based indexing).

Note: As the result can be large, return the sum modulo 109+710^9 + 7.

Constraints:

  • n=n = nums.length

  • 1≤1 \leq nums.length ≤1000\leq 1000

  • 1≤1 \leq nums[i] ≤100\leq 100

  • 1≤1 \leq left ≤\leq right ≤n×(n+1)/2\leq n \times (n + 1) / 2

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Range Sum of Sorted Subarray Sums

Range Sum of Sorted Subarray Sums asks you to sort the sums of every non-empty continuous subarray, then return the total of the entries between the given 1-based positions, modulo a large prime.

Statement

You are given an integer array nums containing nn positive integers along with left and right. Calculate the sum of its elements for every non-empty continuous subarray of nums. Collect these sums into a new array and sort it in nondecreasing order. This will result in a new array of size n×(n+1)/2n \times (n + 1) /2.

Your task is to return the sum of the elements in this sorted array from the index left to right (inclusive with 1-based indexing).

Note: As the result can be large, return the sum modulo 109+710^9 + 7.

Constraints:

  • n=n = nums.length

  • 1≤1 \leq nums.length ≤1000\leq 1000

  • 1≤1 \leq nums[i] ≤100\leq 100

  • 1≤1 \leq left ≤\leq right ≤n×(n+1)/2\leq n \times (n + 1) / 2