Nu aveti permisiuni pentru a descarca fisierul grader_test19.in
Cod sursa(job #2141274)
| Utilizator | Data | 24 februarie 2018 11:37:02 | |
|---|---|---|---|
| Problema | Secventa 5 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 1.08 kb |
#include <iostream>
#include <fstream>
#include <cstring>
#include <unordered_map>
#define DMAX 2000000
using namespace std;
ifstream in("secv5.in");
ofstream out("secv5.out");
unsigned int element[DMAX];
int n, l ,u ;
void citire(){
in >> n >> l >> u;
for(int i = 1; i <= n; i++){
in >> element[i];
}
}
long long numarSecvente(int limita){
unordered_map <unsigned int , int>frecv;
int nrElemDis = 0;
int index = 1;
long long calcul = 0;
for(int i = 1; i <= n; i++){
frecv[element[i]]++;
if(frecv[element[i]] == 1){
nrElemDis++;
}
while(nrElemDis > limita){
frecv[element[index]]--;
if(frecv[element[index]] == 0){
frecv.erase(element[index]);
nrElemDis --;
}
index++;
}
calcul = 1LL*(1LL*(calcul + i) - index);
}
return calcul;
}
void rezolvare(){
out << numarSecvente(u) - numarSecvente(l - 1);
}
int main() {
citire();
rezolvare();
return 0;
}
