Pagini recente » Cod sursa (job #2005975) | Cod sursa (job #32764) | Cod sursa (job #355857) | Cod sursa (job #1853789) | Cod sursa (job #2981464)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
#define N 2000010
#define power 73
#define mod 66666013
#define oo 1e18
long long n,l,u,v[N];
unordered_map<long long, long long>f;
long long fa(long long dif)
{
long long st=1,rez=0,acum=0,i;
for(i=1;i<=n;i++)
{
f[v[i]]++;
if(f[v[i]]==1)
acum++;
while(acum>dif&&st<=i)
{
f[v[st]]--;
if(f[v[st]]==0)
acum--;
st++;
}
rez=rez+i-st+1;
}
return rez;
}
int main()
{long long i
fin>>n>>l>>u;
for(i=1;i<=n;i++)
fin>>v[i];
long long fin=fa(u);
f.clear();
fin=fin-fa(l-1);
fout<<fin;
return 0;
}