Pagini recente » Cod sursa (job #1427852) | Cod sursa (job #1112352) | Cod sursa (job #1152724) | Cod sursa (job #2832614) | Cod sursa (job #2681527)
#include <cstdio>
#include <cctype>
#include <vector>
using namespace std;
typedef pair <int, int> ii;
const int NMAX = (1 << 20) + 5;
const int MOD = 666013;
char buffer[1 << 17];
int sz = (1 << 17), crs = (1 << 17);
void get_int(int &n)
{
for( ; crs < sz && !isdigit(buffer[crs]) ; crs ++);
if(crs == sz)
{
fread(buffer, sz, 1, stdin);
for(crs = 0 ; crs < sz && !isdigit(buffer[crs]) ; crs ++);
}
n = 0;
for( ; crs < sz && isdigit(buffer[crs]) ; crs ++)
n = n * 10 + buffer[crs] - '0';
if(crs == sz)
{
fread(buffer, sz, 1, stdin);
for(crs = 0 ; crs < sz && isdigit(buffer[crs]) ; crs ++)
n = n * 10 + buffer[crs] - '0';
}
}
vector <ii> h[MOD + 5];
void clearh()
{
for(int i = 0 ; i < MOD ; ++ i)
h[i].clear();
}
void inserth(int x)
{
h[x % MOD].push_back({x, 1});
}
int findh(int x)
{
int i, key = x % MOD;
for(int i = 0 ; i < h[key].size() ; i ++)
if(h[key][i].first == x)
return h[key][i].second;
return -1;
}
void updateh(int x, int val)
{
int i, key = x % MOD;
for(int i = 0 ; i < h[key].size() ; i ++)
if(h[key][i].first == x)
h[key][i].second += val;
}
void eraseh(int x)
{
int i, key = x % MOD;
for(int i = 0 ; i < h[key].size() ; i ++)
if(h[key][i].first == x)
{
h[key].erase(h[key].begin() + i);
return;
}
}
int v[NMAX + 5];
long long secv(int n, int lim)
{
if(lim == 0)
return 0;
int st, dr, cnt;
long long nr = 0;
clearh();
cnt = 0;
for(st = dr = 1 ; dr <= n ; ++ dr)
{
if(findh(v[dr]) != -1)
updateh(v[dr], 1);
else
{
inserth(v[dr]);
++ cnt;
}
while(cnt > lim)
{
updateh(v[st], -1);
if(findh(v[st]) == 0)
{
eraseh(v[st]);
-- cnt;
}
++ st;
}
nr += (dr - st + 1);
}
return nr;
}
int main()
{
freopen("secv5.in", "r", stdin);
freopen("secv5.out", "w", stdout);
int n, i, l, u;
get_int(n);
get_int(l);
get_int(u);
for(i = 1 ; i <= n ; ++ i)
get_int(v[i]);
printf("%lld\n", secv(n, u) - secv(n, l - 1));
return 0;
}