You are given an integer array nums of length $n$ and a positive odd integer k.

You need to choose k disjoint non-empty subarrays of nums, denoted by their index ranges $[l_1, r_1], [l_2, r_2], \dots, [l_k, r_k]$, such that $0 \leq l_1 \leq r_1 < l_2 \leq r_2 < \dots < l_k \leq r_k < n$.

The strength of these k chosen subarrays is defined as:

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.