Pagini recente » Cod sursa (job #2382545) | Cod sursa (job #2264137) | Cod sursa (job #2530755) | Cod sursa (job #2874167) | Cod sursa (job #3171228)
#include <bits/stdc++.h>
#include <unordered_map>
const int NMAX=1e7;
using namespace std;
int v[NMAX + 1], n;
int cate(int max){
unordered_map<int, int> frecv;
int l, r, dis, cnt;
l = r = dis = cnt = 0;
for(;r<n;r++){
frecv[v[r]]++;
if(frecv[v[r]] == 1){
dis++;
while(dis > max){
frecv[v[l]]--;
if(frecv[v[l]] == 0){
dis--;
}
l++;
}
}
cnt+= r - l + 1;
}
return cnt;
}
int main(){
int x, y, i;
ifstream cin("secv5.in");
cin>>n>>x>>y;
for(i=0;i<n;i++){
cin>>v[i];
}
cin.close();
ofstream cout("secv5.out");
cout<<cate(y) - cate(x - 1);
cout.close();
return 0;
}