Pagini recente » Cod sursa (job #3219927) | Cod sursa (job #95356) | Cod sursa (job #3164020) | Cod sursa (job #1761459) | Cod sursa (job #2884333)
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
#include <map>
using namespace std;
ifstream in("secv5.in");
ofstream out("secv5.out");
const long long mod = 666013;
map<long long, long long> m1,m2;
vector<long long> v1;
int main() {
long long l, u, n;
long long x;
in >> n ;
in>> l >> u;
for (long long i = 0; i < n; i++) {
in>>x;
v1.push_back(x);
}
long long s=0, cntU=0, cntL=0;
for (long long i=0; i<n; i++) {
m1.insert(pair<long long,long long>(v1[i]%mod,v1[i]));
while(m1.size()>u)
m1.erase(v1[s++]);
cntU += (i-s+1);
}
s = 0;
for (long long i=0; i<n; i++) {
m2.insert(pair<long long,long long>(v1[i]%mod,v1[i]));
while(m2.size()>=l)
m2.erase(v1[s++]);
cntL += (i-s+1);
}
// cout<<cntU<<" "<<cntL<<endl;
cout<< cntU - cntL + 1;
return 0;
}