Pagini recente » Cod sursa (job #1620474) | Cod sursa (job #3189995) | Cod sursa (job #1624471) | Cod sursa (job #2581702) | Cod sursa (job #336605)
Cod sursa(job #336605)
#include<cstdio>
#include<vector>
using namespace std;
const unsigned int m = 699967;
const unsigned int N = (1<<21);
vector<unsigned int> ha[m],hb[m];
unsigned int n,v[N];
int a,b;
void citire()
{
scanf("%u%u%u",&n,&a,&b);
for(unsigned int i=0;i<n;++i)
scanf("%u",&v[i]);
}
bool exista(vector<unsigned int> h[m],unsigned int x)
{
unsigned int r=x%m;
for(vector<unsigned int>::iterator it=h[r].begin() ; it!=h[r].end() ; ++it)
if(*it==x)
return true;
return false;
}
void sterge(vector<unsigned int> h[m],unsigned int x)
{
unsigned int r=x%m;
for(vector<unsigned int>::iterator it=h[r].begin() ; it!=h[r].end() ; ++it)
if(*it==x)
{
h[r].erase(it);
return;
}
}
void adauga(vector<unsigned int> h[m],unsigned int x)
{
h[x%m].push_back(x);
}
void calcul()
{
long long rez=0;
unsigned int i;
int nra=0,nrb=0,pa=-1,pb=-1;
for(i=0;i<n;++i)
{
if(!exista(ha,v[i]))
++nra;
adauga(ha,v[i]);
while(nra==a)
{
sterge(ha,v[++pa]);
if(!exista(ha,v[pa]))
--nra;
}
if(!exista(hb,v[i]))
++nrb;
adauga(hb,v[i]);
while(nrb>b)
{
sterge(hb,v[++pb]);
if(!exista(hb,v[pb]))
--nrb;
}
rez+=pa-pb;
}
printf("%lld\n",rez);
}
int main()
{
freopen("secv5.in","r",stdin);
freopen("secv5.out","w",stdout);
citire();
calcul();
return 0;
}