//cct de problema nu merita implementata niciodata
//am atat de multi nervi
//solutia de 67 e ok
//dupa bagi un cct de arbore al lui gemini
//pisat cacat
#include <iostream>
#include <vector>
#include <cmath>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
struct Node
{
int minpoz;
int st, dr;
};
struct Query
{
int left, right, ind;
};
int n, q;
int cnt, ind;
int v[600005];
pair<int, int> qs[600005];
Node pool[15000005];
int root[600005];
vector<Query> qs_mex[400005];
int bin[23][600005];
int frec[400005];
int nxt[600005];
vector<int> vec[600005];
vector<pair<int, int>> qs_node[600005];
int path[600005];
vector<int> rez;
int head[600005], next_node[600005];
int q_head[600005], q_next[600005], q_left[600005], q_ind[600005];
int q_cnt = 0;
int path_st[600005];
int path_sz = 0;
void update(int cur, int prev, int left, int right, int poz, int val)
{
if(left == right)
{
pool[cur].minpoz = val;
return;
}
int mij = (left + right) / 2;
if(poz <= mij)
{
cnt++;
pool[cur].st = cnt;
pool[pool[cur].st] = pool[pool[prev].st];
pool[cur].dr = pool[prev].dr;
update(pool[cur].st, pool[prev].st, left, mij, poz, val);
}
else
{
cnt++;
pool[cur].dr = cnt;
pool[pool[cur].dr] = pool[pool[prev].dr];
pool[cur].st = pool[prev].st;
update(pool[cur].dr, pool[prev].dr, mij+1, right, poz, val);
}
pool[cur].minpoz = min(pool[pool[cur].st].minpoz, pool[pool[cur].dr].minpoz);
}
int find_mex(int node, int left, int right, int st)
{
if(left == right)
{
return left;
}
int mij = (left + right) / 2;
if(pool[pool[node].st].minpoz < st)
{
return find_mex(pool[node].st, left, mij, st);
}
else
{
return find_mex(pool[node].dr, mij+1, right, st);
}
}
int query(int node, int left, int right, int qleft, int qright)
{
if(qright < left || right < qleft)
{
return n + 1;
}
if(qleft <= left && right <= qright)
{
return pool[node].minpoz;
}
int mij = (left + right) / 2;
return min(query(pool[node].st, left, mij, qleft, qright),
query(pool[node].dr, mij+1, right, qleft, qright));
}
void dfs(int u) {
path_st[path_sz++] = u - 1; // adăugăm nodul pe stack (adjustat cu indexul original)
// Răspundem offline la toate query-urile care se termină în nodul curent `u`
for (int e = q_head[u]; e != -1; e = q_next[e]) {
int L_bound = q_left[e] - 1;
int* it = std::lower_bound(path_st, path_st + path_sz, L_bound);
int idx = it - path_st;
int ans = path_sz - 1 - idx;
if(ans < 0) ans = 0;
rez[q_ind[e] - 1] = ans;
}
// Continuăm DFS-ul în copiii din arbore
for (int v = head[u]; v != -1; v = next_node[v]) {
dfs(v + 1);
}
path_sz--;
}
std::vector<int> solve(int N, std::vector<int> &init, int Q, std::vector<std::pair<int, int>> &initqs)
{
n = N;
q = Q;
for(int i = 0; i<n; i++)
{
v[i + 1] = init[i];
}
for(int i = 0; i<q; i++)
{
qs[i + 1] = initqs[i];
qs[i + 1].first++;
qs[i + 1].second++;
}
for(int i = 1; i<=n; i++)
{
cnt++;
root[i] = cnt;
update(root[i], root[i - 1], 1, 4e5 + 1, v[i], i);
}
rez.resize(q);
for(int i = 1; i<=q; i++)
{
int mex = find_mex(root[qs[i].second], 1, 4e5 + 1, qs[i].first);
if(mex == 1)
{
rez[i - 1] = qs[i].second - qs[i].first + 1;
continue;
}
qs_mex[mex].push_back({qs[i].first, qs[i].second, i});
}
for(int i = 2; i<=400001; i++)
{
if(qs_mex[i].size() == 0)
{
continue;
}
long long cost_sim = 1LL * qs_mex[i].size() * (n / i) * 15LL;
long long cost_dfs = 1LL * n;
if(cost_dfs > cost_sim) //simulez simplu
{
for(auto it: qs_mex[i])
{
int ans = 0;
int cur = it.right;
while(cur >= it.left)
{
int nxt = query(root[cur], 1, 4e5 + 1, 1, i - 1);
if(nxt < it.left)
{
break;
}
ans++;
cur = nxt - 1;
}
rez[it.ind - 1] = ans;
}
}
else
{
int distinct = 0;
for(int j = 0; j <= i; j++) frec[j] = 0;
int L = 1;
for (int r = 1; r <= n; r++) {
if (v[r] < i) {
if (frec[v[r]] == 0) distinct++;
frec[v[r]]++;
}
while (distinct == i - 1) {
if (v[L] < i) {
if (frec[v[L]] == 1) break;
frec[v[L]]--;
}
L++;
}
if (distinct == i - 1) nxt[r] = L;
else nxt[r] = 0;
}
for(int j = -1; j <= n; j++) {
head[j + 1] = -1;
q_head[j + 1] = -1;
}
for (int r = 1; r <= n; r++) {
int p = nxt[r] - 1;
if (p < 0) p = -1;
next_node[r] = head[p + 1];
head[p + 1] = r;
}
q_cnt = 0;
for (auto it : qs_mex[i]) {
int u = it.right;
q_left[q_cnt] = it.left;
q_ind[q_cnt] = it.ind;
q_next[q_cnt] = q_head[u + 1];
q_head[u + 1] = q_cnt++;
}
path_sz = 0;
dfs(0);
dfs(1);
}
}
return rez;
}
