Cod sursa(job #2038995)
Utilizator | Data | 14 octombrie 2017 10:31:45 | |
---|---|---|---|
Problema | Secventa 5 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
unsigned int n,l,r;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
unsigned int a[1024*1024+5];
long long f(int k)
{
int i=1,j;
unordered_map <unsigned int,int> M;
long long nr=0;
for (j=1;j<=n;++j)
{
M[a[j]]++;
while (M.size() > k)
{
M[a[i]]--;
if (M[a[i]]==0) M.erase(a[i]);
i++;
}
nr+=(j-i+1);
}
return nr;
}
int main()
{
fin>>n>>l>>r;
for (int i=1;i<=n;++i)
fin>>a[i];
fout<<f(r)-f(l-1);
return 0;
}