Pagini recente » Cod sursa (job #1589643) | Cod sursa (job #574230) | Cod sursa (job #1278647) | Cod sursa (job #2258558) | Cod sursa (job #1573656)
#include <iostream>
#include <cstdio>
using namespace std;
#include <vector>
#include <unordered_map>
int V[200000000],n;
long long int rez(int limita)
{
long long int r=0;
int s,d;
unordered_map <unsigned int,int> H;
for (s=1,d=1;d<=n;++d)
{
++H[V[d]];
while (H.size()>limita)
{
//H[V[s]]--;
if (--H[V[s]]==0) H.erase(V[s]);
++s;
}
r+=d-s+1;
}
return r;
}
int main()
{
freopen("secv5.in","r",stdin);
freopen("secv5.out","w",stdout);
int s,d,i;
// scanf("%lli %lli %lli",&n,&s,&d);
cin>>n>>s>>d;
for (i=1;i<=n;i++)
{
// scanf("%lli",V[i]);
cin>>V[i];
}
cout<<rez(d)-rez(s-1);
}