Pagini recente » Cod sursa (job #276277) | Cod sursa (job #886127) | Cod sursa (job #3185105) | Cod sursa (job #54118) | Cod sursa (job #3270443)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("secv5.in");
ofstream cout("secv5.out");
long long v[1100005];
map <long long, long long> mp;
int main()
{
long long n, l, u, val, cnt;
cin >> n >> l >> u;
for(long long i = 0; i < n; i++){
cin >> v[i];
}
val = cnt = 0;
for(long long i = 0; i < n; i++){
mp.clear();
val = 0;
for(int j = i; j < n; j++){
mp[v[j]]++;
if(mp[v[j]] == 1){
val++;
}
if(l <= val && val <= u){
cnt++;
}else if(val > u){
break;
}
}
}
cout << cnt;
return 0;
}