Pagini recente » Cod sursa (job #874800) | Cod sursa (job #1063199) | Cod sursa (job #2084624) | Cod sursa (job #189630) | Cod sursa (job #14334)
Cod sursa(job #14334)
#include <stdio.h>
#include <stdlib.h>
const int Nmax = 1048576;
const unsigned int r = 2654435761u;
const int Tmax = 196613;
struct lista
{
int x;
lista *next;
};
typedef lista *hash[Tmax];
hash t;
int n, l, u;
long long sol;
unsigned int sir[Nmax];
int s[Nmax], v[Nmax];
inline void citire()
{
int i;
scanf("%d %d %d\n", &n, &l, &u);
for (i=1; i<=n; ++i)
scanf("%u", &sir[i]);
}
inline long long solve2(int m)
{
long long ret = 0;
int st, dr, ct;
st = 1;
ct = 0;
for (dr=1; dr<=n; ++dr)
{
if (!v[s[dr]])
++ct;
++v[s[dr]];
while (ct > m)
{
if (!(--v[s[st]]))
--ct;
++st;
}
ret += dr - st + 1;
}
for (; st<=n; ++st)
--v[s[st]];
return ret;
}
inline void solve()
{
int i, vl, h, ct = 0;
lista *p;
for (i=1; i<=n; ++i)
{
vl = sir[i];
h = (vl * r) % Tmax;
for (p = t[h];p && (sir[p->x] != vl); p = p -> next);
if (p)
s[i] = s[p -> x];
else
{
p = (lista *) malloc(sizeof(lista));
p -> x = i;
p -> next = t[h];
t[h] = p;
s[i] = ++ct;
}
}
sol = solve2(u) - solve2(l-1);
printf("%lld\n", sol);
}
int main()
{
freopen("secv5.in", "r", stdin);
freopen("secv5.out", "w", stdout);
citire();
solve();
return 0;
}