{"problem":{"name":"Colorful Candies","description":{"content":"There are $N$ candies arranged in a row from left to right.   Each of these candies has one color that is one of the $10^9$ colors called Color $1$, Color $2$, $\\ldots$, and Color $10^9$.   For each $","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc210_c"},"statements":[{"statement_type":"Markdown","content":"There are $N$ candies arranged in a row from left to right.  \nEach of these candies has one color that is one of the $10^9$ colors called Color $1$, Color $2$, $\\ldots$, and Color $10^9$.  \nFor each $i = 1, 2, \\ldots, N$, the color of the $i$\\-th candy from the left is Color $c_i$.\nFrom this row, Takahashi can choose $K$ consecutive candies and get them.  \nThat is, he can choose an integer $i$ such that $1 \\leq i \\leq N-K+1$ and get the $i$\\-th, $(i+1)$\\-th, $(i+2)$\\-th, $\\ldots$, $(i+K-1)$\\-th candy from the left.\nTakahashi likes to eat colorful candies, so the more variety of colors his candies have, the happier he will be.  \nPrint the maximum possible number of distinct colors in candies he gets.\n\n## Constraints\n\n*   $1 \\leq K \\leq N \\leq 3 \\times 10^5$\n*   $1 \\leq c_i \\leq 10^9$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$c_1$ $c_2$ $\\ldots$ $c_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc210_c","tags":[],"sample_group":[["7 3\n1 2 1 2 3 3 1","3\n\nIf Takahashi gets the $3$\\-rd through $5$\\-th candies, they will have $3$ distinct colors, which is the maximum possible number."],["5 5\n4 4 4 4 4","1\n\nTakahashi can get all of these candies, but they are in a single color."],["10 6\n304621362 506696497 304621362 506696497 834022578 304621362 414720753 304621362 304621362 414720753","4"]],"created_at":"2026-03-03 11:01:14"}}