#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bug(x) cerr << #x << " : " << x << '\n'
typedef pair<int, int> pii;
const int maxn = 2e5 + 10;
int n, q;
int a[maxn];
int solve(){
vector<pii> S;
for(int i = 0; i < n; i ++){
S.pb(mp(a[i], i));
}
sort(all(S));
int ans = 0;
int c = 0;
for(int i = 0; i < n; i ++){
c ++;
if(i == n - 1 or S[i].se < S[i + 1].se){
ans = max(ans, c);
c = 0;
}
}
return ans - 1;
}
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
n = A.size();
q = X.size();
for(int i = 0; i < n; i ++)
a[i] = A[i];
vector<int> ans;
for(int i = 0; i < q; i ++){
a[X[i]] = V[i];
ans.pb(solve());
}
return ans;
}
