#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;
struct FenwickTree {
using T = int;
vector<T> bit;
FenwickTree() {}
void resize(int n) {
bit.assign(n + 1, 0);
}
void update(int p, T val) {
for (; p < int(bit.size()); p += p & -p)
maximize(bit[p], val);
}
T get(int p) {
T ans = 0;
for (; p > 0; p -= p & -p)
maximize(ans, bit[p]);
return ans;
}
} fen;
int get(vector<int> a) {
vii b;
for (int i = 0; i < a.size(); ++i) b.emplace_back(a[i], i);
sort (b.begin(), b.end());
int ret = 0;
for (int i = 0; i < a.size(); ++i) maximize(ret, b[i].se - i);
return ret;
}
vector<int> countScans(vector<int> a, vector<int> x, vector<int> v) {
int n = a.size(), q = x.size();
vector<int> ans;
for (int i = 0; i < q; ++i) {
a[x[i]] = v[i];
ans.emplace_back(get(a));
}
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';
for (int _ = 0; _ < 100; ++_) {
int n = 5; vector<int> a(n);
for (auto &x : a) x = random(1, 100);
vector<int> save = a;
int bruh = get(a);
int numPass = 0;
for (int i = 1; i <= n + 1; ++i) {
bool swapped = false;
for (int j = 0; j + 1 < n; ++j) if (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
swapped = true;
}
if (!swapped) {
numPass = i - 1;
break;
}
}
if (numPass != bruh) {
cerr << numPass << ' ' << bruh << '\n';
for (auto &x : save) cerr << x << ' ';
cerr << '\n';
return 0;
}
}
return 0;
}
#endif
