Cod sursa(job #3120408)
Utilizator | Data | 6 aprilie 2023 15:02:32 | |
---|---|---|---|
Problema | Secventa 5 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Teme Pregatire ACM Unibuc 2014, Anul I | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#include <map>
#include <set>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int main(){
int n, l,u;
fin >> n >> l >> u;
int a[n];
for(int i=0; i<n; i++) {
fin >> a[i];
}
int count = 0;
for(int i=0; i<n; i++) {
set<int> s;
for(int j=i; j<n; j++) {
s.insert(a[j]);
if(s.size() >= l && s.size() <= u) {
count++;
}
if(s.size() > u) {
break;
}
}
}
fout << count << endl;
return 0;
}