Pagini recente » Cod sursa (job #2789318) | Cod sursa (job #2697738) | Cod sursa (job #528242) | Cod sursa (job #1965355) | Cod sursa (job #1284822)
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv5.in");
ofstream g("secv5.out");
const int NMAX = (1 << 20) + 1;
int n, l, u;
int v[NMAX];
void citeste() {
f >> n >> l >> u;
for (int i = 1; i <= n; i++) f >> v[i];
}
long long secvente(int x) {
unordered_map <int, int> h;
long long sol = 0;
int j = 1;
for (int i = 1; i <= n; i++) {
h[v[i]]++;
while((int)h.size() > x) {
h[v[j]]--;
if (h[v[j]] == 0) h.erase(v[j]);
j++;
}
sol += (i - j + 1);
}
return sol;
}
int main() {
citeste();
g << secvente(u) - secvente(l - 1) << '\n';
return 0;
}