7533: [CSES Problem Set] Subarray Distinct Values
[Creator : ]
Description
Given an array of $n$ integers, your task is to calculate the number of subarrays that have at most $k$ distinct values.
Input
The 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.
The next line has $n$ integers $x_1,x_2,\dots,x_n$: the contents of the array.
Output
Print one integer: the number of subarrays.
Constraints
$1≤k≤n≤2⋅10^5$
$1 \le x_i \le 10^9$
Sample 1 Input
5 2
1 2 3 1 1
Sample 1 Output
10