Pagini recente » Cod sursa (job #1236193) | Cod sursa (job #2456634) | Cod sursa (job #1386826) | Cod sursa (job #2883429) | Cod sursa (job #2885036)
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv5.in");
ofstream g("secv5.out");
#define cin f
#define cout g
// #define int long long
const int Max = 1e5 + 1;
void nos()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int n,l,u;
int a[Max];
void read()
{
f>>n>>l>>u;
int i;
for(i=1;i<=n;i++)
f>>a[i];
}
long long get_val(int k)
{
if(k == 0)
return 0LL;
long long ans = 0;
int i;
unordered_map < int , int > fr;
int len = 0;
int j = 1;
for(i=1;i<=n;i++)
{
fr[a[i]]++;
if(fr[a[i]] == 1) len ++;
while(len > k)
{
fr[a[j]] --;
if(fr[a[j]] == 0)
len --;
j++;
}
ans += i - j + 1;
}
return ans;
}
void solve()
{
g << get_val(u) - get_val(l - 1);
}
void restart()
{
}
int32_t main()
{
nos();
read();
solve();
restart();
return 0;
}