Pagini recente » Cod sursa (job #3186708) | Cod sursa (job #2820233) | Cod sursa (job #3164259) | Cod sursa (job #2061597) | Cod sursa (job #993328)
Cod sursa(job #993328)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("secv5.in");
ofstream g("secv5.out");
long long n,l,u;
int a[1050000];
int fr1[1050000],fr2[1050000];
long long c1,c2,st,dr1,dr2,solutie;
void Citire()
{ int i;
f>>n>>l>>u;
for(i=1;i<=n;i++)
f>>a[i];
}
int Problema(int p)
{ int sol=0;
fr1[a[1]]=fr2[a[1]]=1;
c1=c2=1;
dr1=1;
dr2=1;
st=1;
while(dr1<=n)
{
if(c1<p)
{
++dr1;
if(++fr1[a[dr1]]==1)
++c1;
}
if(c2<=p)
{
++dr2;
if(++fr2[a[dr2]]==1)
++c2;
}
else
{
sol+=dr2-dr1;
if(--fr1[a[st]]==0)
--c1;
if(--fr2[a[st]]==0)
--c2;
++st;
}
}
if(c1==p && c2==p+1)
sol+=dr2-dr1;
int i;
for(i=0;i<=1000000;i++)
fr1[i]=fr2[i]=0;
return sol;
}
int main()
{
Citire();
int i;
for (i=l;i<=u;i++)
solutie+=Problema(i);
g<<solutie;
f.close();
g.close();
return 0;
}