#include "bubblesort2.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int b[N];
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
int Q = X.size();
std::vector<int> answer(Q);
int n = A.size();
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (A[i] < A[j]) b[i]++;
}
}
int mx = 0;
for (int q = 0; q < Q; q++) {
b[X[q]] = 0;
for (int i = 0; i < X[q]; i++) {
if (A[i] > V[q]) b[X[q]]++;
}
for (int i = X[q] + 1; i < n; i++) {
if (V[q] > A[i]) b[i]++;
}
for (int i = 0; i < n; i++) mx = max(mx, b[i]);
answer.push_back(mx);
A[X[q]] = V[q];
}
return answer;
}
