Shared code

// add me on genshin impact! 607984574
// Problem: Bubble Sort Rounds I
// Attempted: 2025-07-28 07:32:39 EST

#include <bits/stdc++.h>
#ifndef LOCAL
#define debug(...) 0
#else
#include "/Users/envyaims/Documents/template/debug.cpp"
#endif
using namespace std;
using ll = long long;

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define pq priority_queue
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define FORE(i,a,b) for(int i = (a); i <= (b); ++i)
#define ROF(i,a,b) for(int i = (a); i >= (b); --i)
#define trav(a,x) for(auto& a: x)
#define sz(x) (int)x.size()
#define make_unique(v) v.erase(unique(all(v)), v.end());
 
template<class T> using minpq = pq<T, vector<T>, greater<T>>;
template<class T> bool ckmin(T& a, const T& b){return b<a?a=b,1:0;}
template<class T> bool ckmax(T& a, const T& b){return a<b?a=b,1:0;}
template<int D, typename T>struct vt : public vector<vt<D - 1, T>> { template<typename... Args>
	vt(int n = 0, Args... args) : vector<vt<D - 1, T>>(n, vt<D - 1, T>(args...)) {}};
template<typename T> struct vt<1, T> : public vector<T> {
	vt(int n = 0, const T& val = T()) : vector<T>(n, val) {}};
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};

template<typename T>
struct compress{
	vector<T> v;
	int n;
	compress(vector<T> _v){
		v = _v;
		sort(v.begin(), v.end());
		v.erase(unique(v.begin(), v.end()), v.end());
		n = v.size();
	}
	int operator()(T x){
		auto it = lower_bound(v.begin(), v.end(), x);
		assert(it != v.end() && *it == x);
		return it - v.begin();
	}
	T inv(int x){
		assert(x >= 0 && x < n);
		return v[x];
	}
};

void uwu(){
	int n; cin >> n;
	vector<int> a(n); cin >> a;
	vector<int> b = a;
	sort(all(b));
	compress<int> comp(a);
	vector<vector<int>> a_pos(n), b_pos(n);
	FOR(i,0,n){
		a_pos[comp(a[i])].pb(i);
		b_pos[comp(b[i])].pb(i);
	}
	int ans = 0;
	FOR(x,0,comp.n){
		FOR(i,0,sz(a_pos[x])){
			ckmax(ans, max(0, a_pos[x][i] - b_pos[x][i]));
		}
	}
	cout << ans << endl;
}

signed main(){
	cin.tie(0) -> sync_with_stdio(0);
	int t = 1;
	// cin>>t;
	while(t--){
		uwu();
	}
}