Pagini recente » Borderou de evaluare (job #224743) | Cod sursa (job #2650104) | Cod sursa (job #2303972) | Cod sursa (job #2700177) | Cod sursa (job #9777)
Cod sursa(job #9777)
#include <stdio.h>
int v[1048577],p[1048577],n,u,l;
long long s;
void read(){
freopen("secv5.in","r",stdin);
scanf("%d%d%d",&n,&u,&l);
for(int i=1;i<=n;i++)scanf("%d",&v[i]);
}
void face(){
int i,j;
p[1]=1;
for(i=2;i<=n;i++) if (v[i]!=v[i-1])p[i]=p[i-1]+1;
else p[i]=p[i-1];
/*for(i=1;i<=n-1;i++)
for(j=0;j<i;j++)
if (v[i]!=v[j]) p[i]++;
*/
for(i=2;i<=n;i++)
for(j=1;j<i;j++)
if((p[i]-p[j]+1>=u)&&(p[i]-p[j]+1<=l)) s++;
}
void write(){
freopen("secv5.out","w",stdout);
printf("%ld\n",s);
}
int main(){
read();
face();
write();
return 0;
}