Pagini recente » Cod sursa (job #2097728) | Cod sursa (job #777258) | Cod sursa (job #2779588) | Cod sursa (job #902242) | Cod sursa (job #2877999)
#include<bits/bits/stdc++.h>
using namespace std;
ifstream in("secv5.in");
ofstream out("secv5.out");
int n, l, u, v[1050000];
long long func(int &k){
unordered_map<int, int> fr;
long long cnt=0;
for (int i=0;i<n;i++){
int j=0;
fr[v[i]]+=1;
while(fr.size()>k){
fr[v[j]]--;
if(fr[v[j]]==0)
fr.erase(v[j]);
}
j++;
}
cnt+=i-j+1;
}
return cnt;
}
int main(){
in>>n>>l>>u;
for(int i=0;i<n;i++)
cin>>v[i];
out<<func(u)-func(l-1)<<endl;
reuturn 0;
}