K-Subarrays

You are given two integers $N$ and $K$, and an array $A$ of $N$ integers. You have to choose $K$ disjoint non-empty subarrays such that the score is maximized. The score is calculated as follows: $$ \mathrm{Score}= \sum_{i=1}^{K} \mathrm{Sum}[i] \cdot i, $$ where $\mathrm{Sum}[i]$ denotes sum of elements of $i$-th subarray. By the $i$-th subarray, we mean the $i$-th one in the order from