Submission
Status:
[P][P][P][P][P][PPPPP]
Subtask/Task Score:
{17/17}{17/17}{17/17}{17/17}{17/17}{17/17}
Score: 100
User: gay69
Problemset: ละลานตา
Language: cpp
Time: 0.007 second
Submitted On: 2025-08-24 11:53:40
#include <bits/stdc++.h>
using namespace std;
const int maxc = 1e5 + 5;
int freq[maxc];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i]--;
}
long long sum = 0, cur = 0;
int l = 0, r = 0;
while (r < n) {
cur += (freq[arr[r]] == 0);
freq[arr[r]]++;
r++;
while (cur >= k) {
freq[arr[l]]--;
cur -= (freq[arr[l]] == 0);
l++;
}
sum += l;
}
cout << sum << "\n";
return 0;
}