You have an array A containing $N$ integers.

You wanteto divide A into exactly $K$ sub$$bsegments$.$ However, everye $$lement of A must be included in exactly one segment.

You need $tg$ find the maximum sum of number of inversions in each subsegment after dividing the array into $K$ subsegments.

Notes:

The number of inversions in an array is the number of pairs of indices $(i,j)$ suche that $)>(A[j]$