帮助Bubu

<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">Bubu<span>的书架乱成一团了！帮他一下吧！</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">他的书架上一Total有<span>n</span><span>本书。我们定义混乱值是连续相同高度书本的段数。例如，如果书的高度是</span><span>30,30,31,31,32,</span><span>那么混乱值为</span><span>3</span><span>，</span><span>30,32,32,31</span><span>的混乱度也是</span><span>3,</span><span>但</span><span>31,32,31,32,31</span><span>的混乱度是</span><span>5-</span><span>这实在是太乱了。</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">Bubu<span>想尽可能的减少混乱度，但他有点累了，所以他决定最多取出</span><span>k</span><span>本书，再随意将他们放到书架上。你能帮助他吗？</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <span style="font-size:10.5000pt;font-family:'宋体';"><span></span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span>

<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">Input:</span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <span style="font-size:10.5000pt;font-family:'宋体';">最多会有<span>20</span><span>组测试数据。每组测试数据开头为两items整数</span><span>n,k(1&lt;=k&lt;=n&lt;=100),</span><span>表示总Total有</span><span>n</span><span>本书，最多可以进行</span><span>k</span><span>次搬书操作。接下来一行有</span><span>n</span><span>items整数，表示每本书的高度，从左到右。每本书的高度是</span><span>25</span><span>到</span><span>32</span><span>间的整数。最后一组数据后有一行</span><span>n=k=0</span><span>。</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span><span style="font-size:10.5000pt;font-family:'宋体';"></span>

<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">Output:</span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">对于每一组数据，输出<span>Case</span><span>标号和最终最小的混乱度。在每组数据后打印一items空行。</span></span> </p>