408016: GYM102961 ZD Subarray Distinct Values
Memory Limit：256 MB
Time Limit：2 S
Judge Style：Text Compare
Creator：
Submit：0
Solved：0
Description
ZD. Subarray Distinct Valuestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output
Given an array of $$$n$$$ integers, your task is to calculate the number of subarrays that have at most $$$k$$$ distinct values.
InputThe first input line has two integers $$$n$$$ and $$$k$$$.
The next line has $$$n$$$ integers $$$x_1,x_2,\dots,x_n$$$: the contents of the array.
Constraints:
- $$$1 \le k \le n \le 2 \cdot 10^5$$$
- $$$1 \le x_i \le 10^9$$$
Print one integer: the number of subarrays.
ExampleInput5 2 1 2 3 1 1Output
10