Pagini recente » Cod sursa (job #2156260) | Cod sursa (job #1319705) | Cod sursa (job #1716763) | Cod sursa (job #2438782) | Cod sursa (job #2038957)
#include <bits/stdc++.h>
using namespace std;
const int NMAX=(1<<20)+5;
int a[NMAX],n,L,U;
map<int,int>c;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
inline long long Secv(int lug)
{
int j=1,s=0;
long long sol=0;
for(int i=1;i<=n;i++)
{
int x=a[i];
c[x]++;
s+=(c[x]==1);
while(s>lug)
{
int y=a[j];
c[y]--;
s-=(c[y]==0);
j++;
}
sol=sol+(i-j+1);
}
return sol;
}
int main()
{
fin>>n>>L>>U;
for(int i=1;i<=n;i++)
fin>>a[i];
long long x,y;
x=Secv(U);
c.clear();
y=Secv(L-1);
fout<<(x-y)<<"\n";
fin.close();
fout.close();
return 0;
}