[Solution] Monoblock Codeforces Solution| Solution Codeforces

C. Monoblock

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Stanley has decided to buy a new desktop PC made by the company "Monoblock", and to solve captcha on their website, he needs to solve the following task.

The awesomeness of an array is the minimum number of blocks of consecutive identical numbers in which the array could be split. For example, the awesomeness of an array

• [1,1,1]$[1,1,1]$ is 1$1$;
• [5,7]$[5,7]$ is 2$2$, as it could be split into blocks [5]$[5]$ and [7]$[7]$;
• [1,7,7,7,7,7,7,7,9,9,9,9,9,9,9,9,9]$[1,7,7,7,7,7,7,7,9,9,9,9,9,9,9,9,9]$ is 3, as it could be split into blocks [1]$[1]$, [7,7,7,7,7,7,7]$[7,7,7,7,7,7,7]$, and [9,9,9,9,9,9,9,9,9]$[9,9,9,9,9,9,9,9,9]$.

You are given an array a$a$ of length n$n$. There are m$m$ queries of two integers i$i$, x$x$. A query i$i$, x$x$ means that from now on the i$i$-th element of the array a$a$ is equal to x$x$.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Input

In the first line you are given with two integers n$n$ and m$m$ (1≤n,m≤105$1\le n,m\le {10}^5$).

The second line contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤109$1\le a_i\le {10}^9$) — the array a$a$.

In the next m$m$ lines you are given the descriptions of queries. Each line contains two integers i$i$ and x$x$ (1≤i≤n$1\le i\le n$, 1≤x≤109$1\le x\le {10}^9$).

Output

Print the answer to each query on a new line.