Pagini recente » Cod sursa (job #1794666) | Cod sursa (job #1211172) | Cod sursa (job #1824140) | Cod sursa (job #372147) | Cod sursa (job #2468861)
#include <bits/stdc++.h>
#define NMAX 1048576
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int n, l, r, fr[NMAX + 6], v[NMAX + 6], anterior = -1, z;
long long sum = 0;
unordered_map <int, int> h;
int main()
{
fin >> n >> l >> r;
for (int i = 1; i <= n; ++i)
{
int x;
fin >> x;
if (anterior == x)
fr[z]++;
else
v[++z] = x, fr[z] = 1;
anterior = x;
}
if (z < l)
{
fout << 0;
return 0;
}
for (int i = l; i <= z; ++i)
{
int contor = 1;
h[v[i]]++;
int j = i;
while (j >= 1 && contor <= r)
{
if (contor >= l && contor <= r)
sum = 1LL * sum + 1LL * fr[i] * fr[j];
--j;
if (j >= 1)
{
h[v[j]]++;
if (h[v[j]] == 1)
++contor;
}
}
if (j == 0)
j = 1;
for (int k = j; k <= i; ++k)
h[v[k]]--;
}
fout << sum << "\n";
fin.close();
fout.close();
return 0;
}