#include <bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
#define ll long long
const int base = 1<<20;
const ll INF = 1e18+7;
const ll MAXN = 1e6+7;
ll tree[base<<1];
ll lazy[base<<1];
int n;
void push(ll v){
lazy[2*v] += lazy[v];
lazy[2*v+1] += lazy[v];
tree[2*v] += lazy[v];
tree[2*v+1] += lazy[v];
lazy[v] = 0;
}
ll p, k;
ll val;
void update(ll v, ll l, ll r){
if(l > k || r < p) return;
if(p <= l && r <= k){
tree[v] += val;
lazy[v] += val;
}
else{
ll mid = (l+r)/2;
push(v);
update(2*v, l, mid);
update(2*v+1, mid+1, r);
tree[v] = max(tree[2*v], tree[2*v+1]);
}
}
ll query(ll v, ll l, ll r){
if(l > k || r < p) return -INF;
if(p <= l && r <= k){
return tree[v];
}
else{
ll mid = (l+r)/2;
push(v);
auto lQ = query(2*v, l, mid);
auto rQ = query(2*v+1, mid+1, r);
return max(lQ, rQ);
}
}
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
n = A.size();
int Q = X.size();
vector<int> res(Q);
vector<ll> skalowanie;
for(auto i : A){
skalowanie.push_back(i);
}
for(auto i : V){
skalowanie.push_back(i);
}
sort(skalowanie.begin(), skalowanie.end());
map<int, int> skalowanie2;
for(int i = 0; i < skalowanie.size(); ++i){
if(skalowanie2[skalowanie[i]] == 0) skalowanie2[skalowanie[i]] = i+1;
}
int id = skalowanie.size();
p = 0, k = id;
val = -INF;
update(1, 1, id);
for(int i = 0; i < n; ++i){
A[i] = skalowanie2[A[i]]++;
p = 0, k = A[i]-1;
val = 1;
update(1, 1, id);
p = k = A[i];
val = INF + i;
update(1, 1, id);
}
for(int i = 0; i < Q; ++i){
p = 0, k = A[X[i]]-1;
val = -1;
update(1, 1, id);
p = k = A[X[i]];
val = -INF;
update(1, 1, id);
A[X[i]] = skalowanie2[V[i]]++;
p = 0, k = A[X[i]]-1;
val = 1;
update(1, 1, id);
p = k = A[X[i]];
val = INF + X[i];
update(1, 1, id);
p = 0, k = id;
res[i] = query(1, 1, id) - n + 1;
}
return res;
}
