#include "bubblesort2.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>
typedef long long llong;
const int MAXN = 500000 + 10;
const int INF = 1e9;
int n, q;
int a[MAXN];
int in[MAXN];
int order[MAXN];
std::vector <int> countScans(std::vector <int> A, std::vector <int> X, std::vector <int> V)
{
n = A.size();
q = X.size();
for (int i = 1 ; i <= n ; ++i)
{
a[i] = A[i - 1];
}
std::vector <int> answer(q, 0);
for (int query = 0 ; query < q ; ++query)
{
a[X[query] + 1] = V[query];
for (int i = 1 ; i <= n ; ++i)
{
int curr = 0;
for (int j = 1 ; j < i ; ++j)
{
curr += (a[j] > a[i]);
}
answer[query] = std::max(answer[query], curr);
}
}
return answer;
}
