Cod sursa(job #3338681)
| Utilizator | Data | 4 februarie 2026 13:58:48 | |
|---|---|---|---|
| Problema | Secventa 5 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv5.in");
ofstream out("secv5.out");
long long sir[1e7], ans;
int n, i, j, nr;
unordered_map<long long, int> frecv;
long long cnt(int x)
{
while(j < n)
{
frecv[sir[j]]++;
if(frecv[sir[j]]==1)
nr++;
j++;
while(nr>x)
{
frecv[sir[i]]--;
if(frecv[sir[i]]==0)
nr--;
i++;
}
ans += j-i;
}
return ans;
}
int main()
{
int i, l, u;
in >> n >> l >> u;
for(int i = 0; i < n; i++)
in >> sir[i];
out << cnt(u) - cnt(l-1);
return 0;
}
