#ifndef hwe
#include "bubblesort2.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
set<int> s[N];
struct SegmentTree {
vector<ll> nodes, lazy;
int n;
SegmentTree() {}
void resize(int _n) { // 1-index
n = _n; nodes.assign(4 * n + 5, 0), lazy.assign(4 * n + 5, 0);
}
void apply(int id, int l, int r, int val) {
nodes[id] += val;
lazy[id] += val;
}
void push_down(int id, int l, int r) {
if (lazy[id] == 0) return;
int mid = (l + r) >> 1;
apply(id << 1, l, mid, lazy[id]);
apply(id << 1 | 1, mid + 1, r, lazy[id]);
lazy[id] = 0;
}
void update(int id, int l, int r, int u, int v, int val) {
if (l > v || r < u) return;
if (u <= l && r <= v) {
apply(id, l, r, val);
return;
}
push_down(id, l, r); int mid = (l + r) >> 1;
update(id << 1, l, mid, u, v, val);
update(id << 1 | 1, mid + 1, r, u, v, val);
nodes[id] = max(nodes[id << 1], nodes[id << 1 | 1]);
}
void update(int u, int v, int val) {
update(1, 1, n, u, v, val);
}
ll get(int id, int l, int r, int u, int v) {
if (l > v || r < u) return 0;
if (u <= l && r <= v) return nodes[id];
push_down(id, l, r); int mid = (l + r) >> 1;
return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
}
ll get(int u, int v) {
return get(1, 1, n, u, v);
}
} mytree;
// value: (max index) - (num not greater)
// ans = max for all values
vector<int> countScans(vector<int> a, vector<int> x, vector<int> v) {
int n = a.size(), q = x.size();
vector<int> values;
for (auto val : a) values.emplace_back(val);
for (auto val : v) values.emplace_back(val);
remove_duplicate(values);
auto cmp = [&](int x) {
return lower_bound(values.begin(), values.end(), x) - values.begin() + 1;
};
for (int i = 1; i <= values.size(); ++i) {
s[i].clear();
s[i].emplace(0);
}
mytree.resize(values.size());
for (int i = 0; i < n; ++i) {
int val = cmp(a[i]);
s[val].emplace(i + 1);
mytree.update(val, values.size(), -1);
}
for (int i = 1; i <= values.size(); ++i) {
mytree.update(i, i, *s[i].rbegin());
}
vector<int> ans(q);
for (int i = 0; i < q; ++i) {
// a[x[i]] = v[i]
int val1 = cmp(a[x[i]]), val2 = cmp(v[i]);
int tmp = *s[val1].rbegin(); s[val1].erase(x[i] + 1);
mytree.update(val1, val1, *s[val1].rbegin() - tmp);
tmp = *s[val2].rbegin(); s[val2].emplace(x[i] + 1);
mytree.update(val2, val2, *s[val2].rbegin() - tmp);
mytree.update(val1, values.size(), 1);
mytree.update(val2, values.size(), -1);
ans[i] = mytree.nodes[1];
a[x[i]] = v[i];
}
return ans;
}
#ifdef hwe
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n, q; cin >> n >> q;
vector<int> a(n);
for (auto &x : a) cin >> x;
vector<int> x(q), v(q);
for (int i = 0; i < q; ++i) cin >> x[i] >> v[i];
vector<int> ans = countScans(a, x, v);
for (int i = 0; i < q; ++i) cerr << ans[i] << '\n';
return 0;
}
#endif
