Pagini recente » Ausoara | Cod sursa (job #2601464) | Monitorul de evaluare | Cod sursa (job #3186979) | Cod sursa (job #10050)
Cod sursa(job #10050)
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define NMAX (1 << 20)
#define LL long long
#define MOD 699967
#define SZ 6
int N, L, U, MD;
unsigned int a[NMAX];
int pz[NMAX];
int NR[MOD];
unsigned int hash[SZ][MOD];
int nap[SZ * MOD];
int nap1[SZ * MOD];
int main()
{
freopen("secv5.in", "r", stdin);
freopen("secv5.out", "w", stdout);
scanf("%d %d %d\n", &N, &L, &U);
int i, j;
int lung = U, lung1 = L - 1;
int p, nr = 0, q, nr1 = 0;
LL rez = 0;
p = 0;
q = 0;
char s[20];
for (i = 0; i < N; i++) {
fgets(s, 20, stdin);
for (j = 0; '0' <= s[j] && s[j] <= '9'; j++) a[i] = a[i] * 10 + s[j] - '0';
MD = a[i] % MOD;
for (j = 0; j < NR[MD]; j++)
if (hash[j][MD] == a[i]) {
pz[i] = j * MOD + MD;
break;
}
if (j == NR[MD]) {
pz[i] = NR[MD] * MOD + MD;
hash[NR[MD]++][MD] = a[i];
}
nr += ++nap[pz[i]] == 1;
nr1 += ++nap1[pz[i]] == 1;
for (; nr > lung; nr -= --nap[pz[p]] == 0, p++);
for (; nr1 > lung1; nr1 -= --nap1[pz[q]] == 0, q++);
rez += i - p + 1;
rez -= i - q + 1;
}
printf("%lld\n", rez);
fclose(stdin);
fclose(stdout);
return 0;
}