CF1006B Polycarp's Practice

#### 题目翻译 给定长度为n的序列，要求分成k段，最大化每段最大值的和

第一行n和k $(1

输出最大化的值以及k段的长度（输出任意一种）

The first example is described in the problem statement. In the second example there is only one possible distribution. In the third example the best answer is to distribute problems in the following way: $ [1, 2000], [2000, 2] $ . The total profit of this distribution is $ 2000 + 2000 = 4000 $ .