Hello Codeforces.↵
↵
Last week i just trying to solve this problem [bubblesort2](http://s3-ap-northeast-1.amazonaws.com/data.cms.ioi-jp.org/open-2018/2018-open-bubblesort2-en.pdf) so i just was able to solve until the first 2 subtasks, these is my solutions for the first 2 subtask.↵
↵
SUBTASK 1 and 2:↵
`↵
I create an array of pases, for each i (0<=i <n), I store Pases[i]=Solve(i)↵
↵
Solve(i) --> , in it, I will store the amount of prior numbers greater than A[i].↵
↵
and the maximun passes is gonna be the answer.↵
↵
and finally for the update I just do the same but here in O(n), how?↵
↵
let's : Pos= X[i], Nuevo=V[i], Antiguo=A[Pos];↵
↵
I update A[pos]=Nuevo;↵
↵
after that i change the value of Pases[i], just calling the funtion Solve(i), I mean:↵
↵
Pases[Pos]=Solve(Pos);↵
↵
and in order to update all the numbers after Pos (Pos+1 <= j < n), I just use this condition:↵
↵
if(Antiguo >= b and Nuevo < b) Pases[j]--;↵
if(Antiguo <= b and Nuevo > b) Pases[j]++;↵
↵
i finally y just find the maximun value.↵
↵
[Here is my Code](https://ideone.com/RqfJ3m)↵
↵
`↵
this solution gives me 38 points, but now i can't continue anymore, because i don't know how to solve the 3rd subtask and the last one. please help me I am with this problem the last week.
↵
Last week i just trying to solve this problem [bubblesort2](http://s3-ap-northeast-1.amazonaws.com/data.cms.ioi-jp.org/open-2018/2018-open-bubblesort2-en.pdf) so i just was able to solve until the first 2 subtasks, these is my solutions for the first 2 subtask.↵
↵
SUBTASK 1 and 2:↵
I create an array of pases, for each i (0<=i <n), I store Pases[i]=Solve(i)↵
↵
Solve(i) --> , in it, I will store the amount of prior numbers greater than A[i].↵
↵
and the maximun passes is gonna be the answer.↵
↵
and finally for the update I just do the same but here in O(n), how?↵
↵
let's : Pos= X[i], Nuevo=V[i], Antiguo=A[Pos];↵
↵
I update A[pos]=Nuevo;↵
↵
after that i change the value of Pases[i], just calling the funtion Solve(i), I mean:↵
↵
Pases[Pos]=Solve(Pos);↵
↵
and in order to update all the numbers after Pos (Pos+1 <= j < n), I just use this condition:↵
↵
if(Antiguo >= b and Nuevo < b) Pases[j]--;↵
if(Antiguo <= b and Nuevo > b) Pases[j]++;↵
↵
i finally y just find the maximun value.↵
↵
[Here is my Code](https://ideone.com/RqfJ3m)↵
↵
