Pagini recente » Cod sursa (job #1446198) | Cod sursa (job #2541845) | Cod sursa (job #637882) | Cod sursa (job #2189850) | Cod sursa (job #3290391)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("secv5.in");
ofstream cout("secv5.out");
#pragma/cpp.optimize("O3");
#define int long long
int v[1048577];
unordered_map<int,int>vf1;
int32_t main()
{
int n,l,u;
cin>>n>>l>>u;
long long lf=1,cnt=0,cf1=0,cf2=0;
for (int i=1; i<=n; i++)
{
cin>>v[i];
vf1[v[i]]++;
if (vf1[v[i]]==1) cnt++;
while (cnt>u)
{
vf1[v[lf]]--;
if (vf1[v[lf]]==0) cnt--;
lf++;
}
if (cnt<=u) cf1+=i-lf+1;
}
cnt=0,lf=1;
vf1.clear();
for (int i=1; i<=n; i++)
{
vf1[v[i]]++;
if (vf1[v[i]]==1) cnt++;
while (lf<=i&&cnt>=l)
{
vf1[v[lf]]--;
if (vf1[v[lf]]==0) cnt--;
lf++;
}
if (cnt<l) cf2+=i-lf+1;
}
cout<<cf1-cf2;
}