Minimum Maximum Partition

Problem description. You are given a sequence of N integers, A. You need to partition the sequence, where the cost of making a partition from L to R is AL + AR. Output the minimum and maximum total cost of making exactly K partitions where the total cost is the sum of costs of each partition. Input Input description. The first line of the input contains two integesr N and K denoting the number