Pagini recente » Cod sursa (job #1781579) | Cod sursa (job #1886145) | Cod sursa (job #2351806) | Cod sursa (job #1728123) | Cod sursa (job #1895939)
#include <bits/stdc++.h>
#define NMax (1<<20 + 2)
#define mod 666013
#define ui unsigned int
using namespace std;
ifstream f("secv5.in");
ofstream g("secv5.out");
ui n,l,u,first,ans;
ui a[NMax];
long long Count(ui l)
{
unordered_map<ui, ui> H;
first = 1;
long long ans = 0;
for(int i = 1; i <= n; ++i)
{
H[a[i]]++;
while(H.size() > l)
{
H[a[first]]--;
if(H[a[first]] == 0) H.erase(a[first]);
first++;
}
ans += 1LL * (i - first + 1);
}
return ans;
}
int main()
{
f >> n >> l >> u;
for(int i = 1; i <= n; ++i)
f >> a[i];
g << Count(u) - Count(l - 1) << '\n';
return 0;
}