Pagini recente » Cod sursa (job #1014229) | Cod sursa (job #1012651) | Cod sursa (job #219340) | Cod sursa (job #666027) | Cod sursa (job #3279104)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
#define NMAX 1050005
int v[NMAX];
unordered_map<int, int> M;
long long numar(int k, int n) {
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() {
int n, l, u;
fin >> n >> l >> u;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
fout << numar(u, n) - numar(l - 1, n);
return 0;
}