Cod sursa(job #10092)

Utilizator gcosminGheorghe Cosmin gcosmin Data 27 ianuarie 2007 21:07:54
Problema Secventa 5 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.14 kb
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;

#define NMAX (1 << 20)
#define LL long long
#define MOD 1999993
#define SZ 7

int N, L, U, MD;

unsigned int a[NMAX];
int pz[NMAX];

int nap[NMAX];
int nap1[NMAX];

int NR[MOD];
unsigned int hash[SZ][MOD];
int jeg[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];

	int kkt = 0;

	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] = jeg[j][MD];
				break;
			}
		if (j == NR[MD]) {
			pz[i] = kkt;
			jeg[NR[MD]][MD] = kkt;
			kkt++;
			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 += q - p;
	}

	printf("%lld\n", rez);

fclose(stdin);
fclose(stdout);
return 0;
}