Submission

Status:

[P][P][P][P][P][TSSSS]

Subtask/Task Score:

{17/17}{17/17}{17/17}{17/17}{17/17}{0/17}

Score: 85

User: FakeAnutin

Problemset: ละลานตา

Language: cpp

Time: 1.093 second

Submitted On: 2026-10-07 16:51:10

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int arr[100005];
int main(){
	ll n,c; cin>>n>>c;
	int mx=0;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	ll coc=0;
	for(int i=1;i<=n-c;i++){
		vector<int> temp(100000,0);
		int cc=0;
		for(int j=i;j<=n;j++){
			if(temp[arr[j]]==0){
				temp[arr[j]]=1;
				cc++;
			}
			if(cc >= c){
				coc += n+1-j;
				break;
			}
		}
	}
	cout<<coc;
}