#include <bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
#define ll long long
const ll base = 1<<20;
const ll INF = 1e18+7;
ll tree[base<<1];
ll lazy[base<<1];
ll 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();
ll Q = X.size();
vector<int> res(Q);
map<long long, ll> skalowanie;
for(auto i : A){
skalowanie[i] = 0;
}
for(auto i : V){
skalowanie[i] = 0;
}
ll id = 0;
for(auto &i : skalowanie) i.second = ++id;
for(ll i = 0; i < n; ++i){
auto vi = A[i];
p = 0, k = skalowanie[vi]-1;
val = 1;
update(1, 1, id);
}
for(ll i = 0; i < Q; ++i){
p = 0, k = skalowanie[A[X[i]]]-1;
val = -1;
update(1, 1, id);
A[X[i]] = V[i];
p = 0, k = skalowanie[V[i]]-1;
val = 1;
update(1, 1, id);
for(ll j = 0; j < n; ++j){
p = k = skalowanie[A[j]];
// cerr << query(1, 1, n) << " ";
res[i] = max((ll)(res[i]), query(1, 1, id) - (n - j - 1));
}
// cerr << "\n";
}
return res;
}
