#include "bubblesort2.h"
#include<bits/stdc++.h>
using namespace std;
int ult[105],sub[105];
map<int,set<int>> ofval;
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V)
{
ofval.clear();
for(int i=0;i<A.size();i++)
{
assert(1<=A[i] && A[i]<=100);
ofval[A[i]].insert(i);
}
vector<int> sol;
for(int i=0;i<X.size();i++)
{
assert(1<=V[i] && V[i]<=100);
ofval[A[X[i]]].erase(X[i]);
A[X[i]] = V[i];
ofval[A[X[i]]].insert(X[i]);
int pref=0,mxm=0;
for(int val=1;val<=100;val++)
{
if(ofval[val].empty())
continue;
pref += ofval[val].size();
int ult = *ofval[val].rbegin();
mxm = max(mxm, ult - (pref-1));
}
sol.push_back(mxm);
}
return sol;
}
