Pagini recente » Cod sursa (job #1050749) | Cod sursa (job #1245694) | Cod sursa (job #1828025) | Cod sursa (job #145475) | Cod sursa (job #2863631)
#include <fstream>
#include <unordered_map>
#include <stdio.h>
#include <ctype.h>
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()));
n = c - '0';
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
return *this;
}
InParser& operator >> (unsigned int &n) {
char c;
while (!isdigit(c = read_ch()));
n = c - '0';
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
return *this;
}
};
using namespace std;
int n,l,u;
unsigned int v[1<<20+1];
unordered_map < unsigned int , int > ap;
long long secv(int k)
{
ap.clear();
long long st=1,cnt=0;
for(int dr=1;dr<=n;++dr)
{
++ap[v[dr]];
while(ap.size()>k)
{
--ap[v[st]];
if(ap[v[st]]==0)
ap.erase(v[st]);
++st;
}
cnt+=dr-st+1;
}
return cnt;
}
int main()
{
InParser fin("secv5.in");
ofstream fout("secv5.out");
fin >> n >> l >> u;
for(int i=1;i<=n;++i)
fin >> v[i];
fout << secv(u)-secv(l-1);
return 0;
}