Pagini recente » Cod sursa (job #172082) | Cod sursa (job #1565899) | Cod sursa (job #436428) | Cod sursa (job #2889720) | Cod sursa (job #2473471)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int n, l, u, v[1048580];
int f(int x)
{
if (x == 0) return 0;
unordered_map <int, int> h;
int ans = 1;
int contor = 1, st = 1;
h[v[1]] = 1;
for (int i = 2; i <= n; ++i)
{
h[v[i]]++;
if (h[v[i]] == 1)
++contor;
while (contor > x)
{
h[v[st]]--;
if (h[v[st]] == 0)
--contor;
++st;
}
ans += i - st + 1;
}
return ans;
}
int main()
{
fin >> n >> l >> u;
for (int i = 1; i <= n; ++i)
fin >> v[i];
fout << f(u) - f(l - 1);
fin.close();
fout.close();
return 0;
}