Pagini recente » Cod sursa (job #27547) | Cod sursa (job #889530) | Cod sursa (job #2527431) | Cod sursa (job #70569) | Cod sursa (job #2957528)
#include <bits/stdc++.h>
std::ifstream cin("secv5.in");
std::ofstream cout("secv5.out");
std::unordered_map<int,int>f;
int n,u,l,v[1050000];
long long raspunde(long long a)
{
f.clear();
long long ans=0;
long long b=1,ff=0;
for(long long e=1;e<=n;++e)
{
++f[v[e]];
if(f[v[e]]==1)
++ff;
while(ff>a&&b<=e)
{
--f[v[b]];
if(f[v[b++]]==0)
--ff;
}
ans+=e-b+1;
}
return ans;
}
int main()
{
cin>>n>>u>>l;
for(int i=1;i<=n;++i)
cin>>v[i];
long long z=raspunde(l),zz=raspunde(u-1);
cout<<z-zz;
return 0;
}