CF1415B Repainting Street

- 有一条街道，$n$ 栋房子排成一行，编号从 $1$ 到 $n$。每个房子的颜色为 $c_i$ ，工人每次可粉刷连续的 $k$ 个房子，求出将整条街刷成同一个颜色的最短的次数。 ------------

- 第一行输入整数 $t$ 为街道的条数，并且保证 $t$（$1 \leqslant t \leqslant {10}^4$） - 第二行输入两个整数 $n$ 和 $k$（$1 \leqslant k \leqslant n \leqslant {10}^5$） - 第三行输入房屋初始颜色 $c_i$（$1 \leqslant c_i \leqslant 100$） ------------

- 输出 $t$ 行，每行为每个街道粉刷需要的最少天数 Translated by [Seth](https://www.luogu.com.cn/user/358800).

In the first test case Tom should paint houses 1 and 2 in the first day in color 2, houses 5 and 6 in the second day in color 2, and the last house in color 2 on the third day. In the second test case Tom can, for example, spend 6 days to paint houses 1, 2, 4, 5, 6, 7 in color 3. In the third test case Tom can paint the first house in the first day and houses 6, 7, and 8 in the second day in color 3.