Pagini recente » Cod sursa (job #1106613) | Cod sursa (job #680446) | Cod sursa (job #313288) | Cod sursa (job #396153) | Cod sursa (job #3173230)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("secv5.in");
ofstream cout("secv5.out");
int n;
long long v[1050000];
int f(int k)
{
int ans=0;
unordered_map<long long, long long> fr;
long long l=1, cnt=0;
for(int r=1; r<=n; r++)
{
fr[v[r]]++;
if(fr[v[r]]==1)
{
cnt++;
while(cnt>k)
{
fr[v[l]]--;
if(fr[v[l]]==0)
cnt--;
l++;
}
}
ans+=r-l+1;
}
return ans;
}
int main()
{
long long l, u;
cin>>n>>l>>u;
for(int i=1; i<=n; i++)
cin>>v[i];
cout<<f(u)-f(l-1);
return 0;
}