CF180E.Cubes

Let's imagine that you're playing the following simple computer game. The screen displays n lined-up cubes. Each cube is painted one of m colors. You are allowed to delete not more than k cubes (that do not necessarily go one after another). After that, the remaining cubes join together (so that the gaps are closed) and the system counts the score. The number of points you score equals to the length of the maximum sequence of cubes of the same color that follow consecutively. Write a program that determines the maximum possible number of points you can score.

Remember, you may delete no more than k any cubes. It is allowed not to delete cubes at all.

我们来想象一下你正在玩如下简单的电脑游戏：屏幕上显示一排共 $n$ 个立方体。每个立方体被涂上 $m$ 种颜色中的一种。你最多可以删除 $k$ 个立方体（这些立方体不必相邻）。删除后，剩余的立方体将向左靠拢（即填补空隙），系统会计算你的得分。你的得分等于剩余立方体中最长的、颜色相同的连续立方体序列的长度。

请编写一个程序，计算你能获得的最大可能得分。

注意：你最多可删除任意 $k$ 个立方体，也可以一个都不删除。

The first line contains three integers n, m and k (1 ≤ n ≤ 2·105, 1 ≤ m ≤ 105, 0 ≤ k < n). The second line contains n integers from 1 to m — the numbers of cube colors. The numbers of colors are separated by single spaces.

第一行包含三个整数 $n$、$m$ 和 $k$（$1 ≤ n ≤ 2·10^5$，$1 ≤ m ≤ 10^5$，$0 ≤ k < n$）。第二行包含 $n$ 个介于 $1$ 到 $m$ 之间的整数——表示立方体的颜色编号。颜色编号之间以单个空格分隔。

Print the maximum possible number of points you can score.

输出你能获得的最高分数。

In the first sample you should delete the fifth and the sixth cubes.

In the second sample you should delete the fourth and the seventh cubes.

In the third sample you shouldn't delete any cubes.

在第一个样例中，你应该删除第五个和第六个方块。

在第二个样例中，你应该删除第四个和第七个方块。

在第三个样例中，你不应删除任何方块。