Pagini recente » Cod sursa (job #1046332) | Cod sursa (job #2049558) | Cod sursa (job #2648907) | Cod sursa (job #1137333) | Cod sursa (job #3279119)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
#define NMAX 1050000
int n, l, u;
unsigned int v[NMAX];
unordered_map<unsigned int, int> M;
long long numar(int k) {
M.clear();
long long cnt = 0;
int i = 1;
int nr = 0;
for (int j = 1; j <= n; ++j) {
++M[v[j]];
if (M[v[j]] == 1) {
nr++;
}
while (nr > k) {
--M[v[i]];
if (M[v[i]] == 0) {
--nr;
}
++i;
}
cnt += j - i + 1;
}
return cnt;
}
int main() {
fin >> n >> l >> u;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
fout << numar(u) - numar(l - 1);
return 0;
}