Pagini recente » Cod sursa (job #1432663) | Cod sursa (job #2855273) | Cod sursa (job #2132847) | Cod sursa (job #1351616) | Cod sursa (job #3185797)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("secv5.in");
ofstream cout("secv5.out");
int n;
long long int v[1<<20];
long long rasp(long long x)
{
unordered_map < long long int, int > f;
long long int cnt = 0, ans;
int i, j;
i = j = ans = 0;
while(i < n)
{
f[v[i]]++;
if(f[v[i]] == 1)
cnt++;
i++;
while(cnt > x)
{
f[v[j]]--;
if(f[v[j]] == 0)
cnt--;
j++;
}
ans += i - j;
}
return ans;
}
int main()
{
int a, b;
cin >> n >> a >> b;
for(int i = 0; i < n; i++)
cin >> v[i];
cout << rasp(b) - rasp(a - 1);
return 0;
}