Pagini recente » Cod sursa (job #2916850) | Cod sursa (job #3040091) | Monitorul de evaluare | Cod sursa (job #2922110) | Cod sursa (job #1566210)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int n, l, u;
unsigned int v[1<<20 + 1];
unordered_map<unsigned int, int> h;
long long sec(int m)
{
h.clear();
long long indx = 1, rez = 0;
for (int i = 1; i <= n; ++i)
{
h[v[i]]++;
while (h.size() > m)
{
h[v[indx]]--;
if (h[v[indx]] == 0)
h.erase(v[indx]);
indx++;
}
rez += i - indx + 1;
}
return rez;
}
int main()
{
fin >> n >> l >> u;
for (int i = 1; i <= n; ++i)
{
fin >> v[i];
}
fout << sec(u) - sec(l - 1);
return 0;
}