Pagini recente » Cod sursa (job #2712402) | Cod sursa (job #623708) | Cod sursa (job #3176573) | Cod sursa (job #1339515) | Cod sursa (job #2259297)
#include <bits/stdc++.h>
using namespace std;
class InParser
{
private:
FILE *fin;
char *buff;
int sp;
char read_ch()
{
++sp;
if(sp==4096)
{
sp=0;
fread(buff,1,4096,fin);
}
return buff[sp];
}
public:
InParser(const char* nume)
{
fin=fopen(nume,"r");
buff=new char[4096]();
sp=4095;
}
InParser& operator >> (int &n)
{
char c;
while(!isdigit(c=read_ch())&&c!='-');
int sgn=1;
if (c=='-')
{
n=0;
sgn=-1;
}
else
{
n=c-'0';
}
while(isdigit(c=read_ch()))
{
n=10*n+c-'0';
}
n*=sgn;
return *this;
}
InParser& operator >> (long long &n)
{
char c;
n=0;
while(!isdigit(c=read_ch())&&c!='-');
long long sgn=1;
if(c=='-')
{
n=0;
sgn=-1;
}
else
{
n=c-'0';
}
while(isdigit(c=read_ch()))
{
n=10*n+c-'0';
}
n*=sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
InParser fin("secv5.in");
OutParser fout("secv5.out");
const int Nmax = 2e6;
unordered_map < long long , int > M;
long long a[Nmax];
int n, L, U;
int main()
{
int i, j, nrd;
long long s, s1;
fin >> n >> L >> U;
for(i = 1 ; i <= n ; i++)
fin >> a[i];
j = 1;
nrd = 0;
s = s1 = 0;
for(i = 1 ; i <= n ; i++)
{
++M[a[i]];
if(M[a[i]] == 1)
++nrd;
while(nrd > U && j <= i)
{
--M[a[j]];
if(M[a[j]] == 0)
--nrd;
++j;
}
s += (i - j + 1);
}
M . clear();
U = L - 1;
j = 1;
nrd = 0;
for(i = 1 ; i <= n ; i++)
{
++M[a[i]];
if(M[a[i]] == 1)
++nrd;
while(nrd > U)
{
--M[a[j]];
if(M[a[j]] == 0)
--nrd;
++j;
}
s1 += (i - j + 1);
}
fout << (s - s1) << "\n";
return 0;
}