Pagini recente » Cod sursa (job #1656649) | Cod sursa (job #1892327) | Cod sursa (job #1982630) | Cod sursa (job #979542) | Cod sursa (job #1573835)
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
#define maxN 1<<20 + 5
using namespace std;
unsigned int V[maxN];
int n;
long long NrSec(int k){
unordered_map <unsigned int, int> H;
long long s;
int nr, d;
s = nr = d = 0;
for (int i = 0; i < n; ++i){
H[V[i]]++;
nr++;
if (H[V[i]] == 1)
d++;
while (d > k){
if (H[V[i - nr + 1]] == 1)
d--;
H[V[i - nr + 1]]--;
nr--;
}
s += nr;
}
return s;
}
int main(){
ifstream f("secv5.in");
ofstream g("secv5.out");
int l, u;
f >> n >> l >> u;
for (int i = 0; i < n; ++i)
f >> V[i];
long long x, y;
x = NrSec(u);
y = NrSec(l - 1);
g << x - y;
f.close();
g.close();
return 0;
}