Pagini recente » Cod sursa (job #3353953) | Cod sursa (job #3324748) | Cod sursa (job #3142017) | Borderou de evaluare (job #1896294) | Cod sursa (job #3324747)
#include <fstream>
#include <map>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
long long v[1000005];
unordered_map<long long, int> m;
long long nrsecv(int nr, int n)
{
int i = 1, j = 1, c = 0;
long long secv = 0;
m.clear();
while (i <= n)
{
if (m[v[i]] == 0)
{
c++;
}
m[v[i]]++;
while (c > nr)
{
m[v[j]]--;
if (m[v[j]] == 0)
{
c--;
}
j++;
}
secv += (i - j + 1);
i++;
}
return secv;
}
int main()
{
int l, u, n;
fin >> n >> l >> u;
for (int i = 1; i <= n; i++)
{
fin >> v[i];
}
fout << nrsecv(u, n) - nrsecv(l - 1, n);
}