Submission

Score: 85

User: APNICHANAN

Problemset: ละลานตา

Language: cpp

Time: 1.082 second

Submitted On: 2025-10-12 17:11:26

#include <iostream>
#include <set>
using namespace std;
int main()
{
    set<int> b;
    int n, k, cnt = 0;
    cin >> n >> k;
    int c[n];
    for (int i = 0; i < n; i++)
        cin >> c[i];

    for (int i = 0; i < n - k; i++)
    {
        b.clear();
        for (int j = i; j < n; j++)
        {
            b.insert(c[j]);
            if (b.size() >= k)
            {
                cnt += n - j;
                break;
            }
        }
    }
    cout << cnt << endl;
}