Cod sursa(job #3268186)
| Utilizator | Data | 13 ianuarie 2025 20:57:34 | |
|---|---|---|---|
| Problema | Secventa 5 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int v[1048577];
int n;
int secv(int c)
{
unordered_map<int,int> M;
int st=1,cnt=0,ans=0;
for(int dr=1;dr<=n;dr++)
{
M[v[dr]]++;
if(M[v[dr]]==1) cnt++;
while(cnt>c)
{
M[v[st]]--;
if(M[v[st]]==0) cnt--;
st++;
}
ans+=dr-st+1;
}
return ans;
}
int main()
{
int u,l;
fin>>n>>l>>u;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
fout<<secv(u)-secv(l-1);
}
