Pagini recente » Cod sursa (job #270426) | Cod sursa (job #413572) | Cod sursa (job #2893394) | Cod sursa (job #2727108) | Cod sursa (job #3270426)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("secv5.in");
ofstream cout("secv5.out");
int v[1100005];
map <int, int> mp;
int main()
{
int n, l, u, val, cnt;
cin >> n >> l >> u;
for(int i = 0; i < n; i++){
cin >> v[i];
}
val = cnt = 0;
for(int 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++;
}
}
}
cout << cnt;
return 0;
}