Problem Description

Bubble sort is an algorithm for sorting a sequence. We want to sort a sequence $A_0, A_1, \ldots, A_{N-1}$ of length $N$ in non-decreasing order. When two adjacent numbers are not in the correct order, bubble sort swaps these two numbers. This kind of swapping is performed while scanning the sequence. More precisely, in one scan, for $i = 0, 1, \ldots, N - 2$ in this order, if $A_i > A_{i+1}$, then we swap these two numbers. It is well known that after a finite number of scans, any sequence can be sorted in non-decreasing order. For a sequence $A$, we define the number of bubble sort scans as the number of scans needed to sort $A$ using the algorithm above.

JOI has a sequence $A$ of length $N$. He plans to process $Q$ queries that modify the values in $A$. More precisely, in the $(j+1)$-th query $(0 \le j \le Q - 1)$, the value of $A_{X_j}$ will be changed to $V_j$.

JOI wants to know, after each modification, the number of bubble sort scans needed.

Input Format

On LOJ this is an interactive problem. For convenience, here it is judged in the traditional (non-interactive) format.

The first line contains two integers $N, Q$.

The second line contains $N$ integers $A_0, A_1, \ldots, A_{N-1}$.

The next $Q$ lines each contain two integers $X_j, V_j$.

Output Format

Output $Q$ lines. The $(j+1)$-th line $(0 \le j \le Q - 1)$ should be the number of bubble sort scans for the sequence after processing the $(j+1)$-th query.

4 2
1 2 3 4
0 3
2 1

1
2

11 12
11 4 13 6 7 3 5 12 4 10 11
8 11
4 4
6 20
0 2
7 2
3 18
5 9
0 6
8 8
9 4
0 8
6 18

5
5
5
4
6
6
6
7
7
7
7
7

Hint

Sample Explanation

Given a sequence of length $N = 4$, $A = \{1, 2, 3, 4\}$, and $Q = 2$ queries: $X = \{0, 2\}, V = \{3, 1\}$.

1. For the first query, the value of $A_0$ becomes $3$. We get $A = \{3, 2, 3, 4\}$.
2. For the second query, the value of $A_2$ becomes $1$. We get $A = \{3, 2, 1, 4\}$.

Perform bubble sort on $A = \{3, 2, 3, 4\}$:

• $A$ is not sorted, so the first scan starts. Since $A_0 > A_1$, we swap them, and the sequence becomes $A = \{2, 3, 3, 4\}$. Since $A_1 \le A_2$, we do not swap them. Since $A_2 \le A_3$, we also do not swap them.
• Now $A$ is sorted, so the bubble sort process ends.

Therefore, for $A = \{3, 2, 3, 4\}$, the number of bubble sort scans is $1$.

Perform bubble sort on $A = \{3, 2, 1, 4\}$:

• $A$ is not sorted, so the first scan starts. Since $A_0 > A_1$, we swap them, and the sequence becomes $A = \{2, 3, 1, 4\}$. Since $A_1 > A_2$, we swap them, and the sequence becomes $A = \{2, 1, 3, 4\}$. Since $A_2 \le A_3$, we also do not swap them.
• $A$ is not sorted, so the second scan starts. Since $A_0 > A_1$, we swap them, and the sequence becomes $A = \{1, 2, 3, 4\}$. Since $A_1 \le A_2$, we do not swap them. Since $A_2 \le A_3$, we also do not swap them.
• Now $A$ is sorted, so the bubble sort process ends.

Therefore, for $A = \{3, 2, 1, 4\}$, the number of bubble sort scans is $2$.

Constraints

There are four subtasks. The score and additional constraints for each subtask are as follows:

Translated by ChatGPT 5