# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054416 | NeroZein | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
int count(vector<int> a) {
int ret = 0;
int n = (int) a.size();
vector<int> ord(n);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int i, int j) {
return (a[i] == a[j] ? i < j : a[i] < a[j]);
});
int cnt = 0;
for (int i : ord) {
ret = max(ret, i - cnt);
cnt++;
}
return ret;
}
vector<int> countScans(vector<int> a, vector<int> x, vector<int> v) {
int q = (int) x.size();
vector<int> ret(q);
for (int i = 0; i < q; ++i) {
a[x[i]] = v[i];
ret[i] = count(a);
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> x(q), v(q);
for (int i = 0; i < q; ++i) {
cin >> x[i] >> v[i];
}
vector<int> answers = countScans(a, x, v);
for (int i : answers) {
cout << i << '\n';
}
return 0;
}