Pagini recente » Cod sursa (job #2181565) | Cod sursa (job #3347023) | Cod sursa (job #3314383) | Cod sursa (job #157633) | Cod sursa (job #3311756)
#include <iostream>
#include <vector>
using namespace std;
long long freq[1048580];
int main()
{
vector<int>v;
int n,l,u,x,cnt=0;
cin>>n>>l>>u;
for(int i=0;i<n;i++){
cin>>x;
v.push_back(x);
}
int st=0,dr=-1;
int frecv=0;
while(st<n){
dr++;
freq[v[dr]]++;
if(freq[v[dr]]==1){
frecv++;
cout<<v[dr]<<endl;
}
cout<<frecv<<" "<<st<<" "<<dr<<endl;
if(frecv>=l && frecv<=u){
cnt=cnt+dr-st+1;
cout<<cnt<<endl;
}
if(frecv>u || dr==n){
cout<<st;
if(freq[v[st]]==1){
frecv=frecv-1;
freq[v[st]]=0;
st++;
cout<<111111111111;}
else{
freq[v[st]]--;
st++;
}
}
}
cout<<cnt;
}