Pagini recente » Cod sursa (job #1437340) | Cod sursa (job #2770144) | Cod sursa (job #2196114) | Cod sursa (job #1938495) | Cod sursa (job #1474536)
#include <fstream>
#include <unordered_map>
#define NMax (1<<20)+1
using namespace std;
ifstream f("secv5.in");
ofstream g("secv5.out");
int n,l,u,i,j;
unsigned int a[NMax];
unordered_map<unsigned int,unsigned int> H;
long long int until(int x)
{
H.clear();
long long int sum=0;
for(i=j=1;i<=n;++i)
{
H[a[i]]++;
while(x<H.size())
{
--H[a[j]];
if(!H[a[j]])H.erase(a[j]);
++j;
}
sum=sum+(i-j+1);
}
return sum;
}
int main()
{
f>>n>>l>>u;
for(i=1;i<=n;++i) f>>a[i];
g<<until(u)-until(l-1);
}