Pagini recente » Cod sursa (job #694480) | Cod sursa (job #933643) | Cod sursa (job #1801867) | Cod sursa (job #1768242) | Cod sursa (job #9708)
Cod sursa(job #9708)
#include <stdio.h>
#define MAX 2000001
int n, o, p;
long int sol, nr;
int a[MAX], s[MAX];
void citire ();
void solve ();
void afisare ();
int main ()
{
freopen ( "secv5.in", "r", stdin );
freopen ( "secv5.out", "w", stdout );
citire ();
solve ();
afisare ();
return 0;
}
void citire ()
{
int i;
scanf ( "%d %d %d", &n, &o, &p );
for ( i = 1; i <= n; i++ )
scanf ( "%d", &a[i] );
// for ( i = 1; i <= n; i++ )
// printf ( "%d ", a[i] );
}
void solve ()
{
int i, j;
for ( i = 1; i <= n; i++ )
{
nr = 0;
for ( j = i; j <= n; j++ )
{
if ( s[a[j]] != i )
{
s[a[j]] = i;
nr++;
}
if ( nr >= o && nr <= p )
sol++;
if ( nr > p )
break;
}
}
}
void afisare ()
{
printf ( "%ld", sol );
}