CP LAB/p1a.java
// Experiment-1

// a. Write a JAVA Program to find Subarrays with K Different integers Given an array A of positive
// integers, call a (contiguous, not necessarily distinct) subarray of A good if the number of
// different integers in that subarray is exactly K.
// (For example, [1,2,3,1,2] has 3 different integers: 1, 2, and 3) Return the number of good
// subarrays of A.

// Example 1:
// Input: A = [1,2,1,2,3], K = 2
// Output: 7
// Explanation: Subarrays formed with exactly 2 different integers: [1,2], [2,1], [1,2], [2,3],
// [1,2,1], [2,1,2], [1,2,1,2]

// Example 2:
// Input: A = [1,2,1,3,4], K = 3
// Output: 3
// Explanation: Subarrays formed with exactly 3 different integers: [1,2,1,3], [2,1,3], [1,3,4].

// Note:
// 1 <= A.length <= 20000
// 1 <= A[i] <= A.length
// 1 <= K <= A.length

import java.util.*;

public class p1a {
    static int subarraysWithKDistinct(int[] A, int K) {
        int n = A.length, ans = 0;
        for (int i = 0; i < n; i++) {
            Set<Integer> set = new HashSet<>();
            for (int j = i; j < n; j++) {
                set.add(A[j]);
                if (set.size() == K)
                    ans++;
                else if (set.size() > K)
                    break;
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int arr[] = new int[n];
        for (int i = 0; i < n; i++)
            arr[i] = sc.nextInt();
        int k = sc.nextInt();
        System.out.println(subarraysWithKDistinct(arr, k));
        sc.close();
    }
}
