Pagini recente » Cod sursa (job #2708744) | Cod sursa (job #490307) | Cod sursa (job #1054128) | Cod sursa (job #823656) | Cod sursa (job #3221195)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
const int NMax = (1 << 21) + 5;
unsigned V[NMax];
long long cnt(int P, int N){
long long numar = 0, prec = 0;
long long st = 1;
unordered_map<int, int> M;
for(int i=1; i<=N; ++i){
M[V[i]] ++;
prec ++;
while(M.size() > P){
M[V[st]] --;
if(M[V[st]] == 0){
M.erase(V[st]);
}
st ++;
prec --;
}
numar += prec;
}
return numar;
}
int main()
{
int N, L, U;
fin >> N >> L >> U;
for(int i=1; i<=N; ++i){
fin >> V[i];
}
fout << cnt(U, N) - cnt(L - 1, N);
return 0;
}