184 lines
3.6 KiB
C++
184 lines
3.6 KiB
C++
/* Problem URL: https://codeforces.com/problemset/problem/1862/G */
|
|
|
|
#include <bits/stdc++.h>
|
|
#include <ext/pb_ds/assoc_container.hpp>
|
|
#include <ext/pb_ds/tree_policy.hpp>
|
|
|
|
using namespace std;
|
|
using namespace __gnu_pbds;
|
|
|
|
template <class T, class comp = less<>>
|
|
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (int i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
const int oo = INT32_MAX >> 1;
|
|
const ll OO = INT64_MAX >> 1;
|
|
|
|
|
|
void pre()
|
|
{
|
|
|
|
}
|
|
|
|
#define TEST 1
|
|
|
|
void solve()
|
|
{
|
|
int n;
|
|
cin >> n;
|
|
|
|
vl a(n);
|
|
cin >> a;
|
|
|
|
map<ll, int> act;
|
|
multiset<ll> diff;
|
|
diff.insert(0);
|
|
|
|
repv(i, a) {
|
|
act[i]++;
|
|
}
|
|
|
|
{
|
|
auto itr = next(act.begin());
|
|
auto prev = act.begin();
|
|
while (itr != act.end()) {
|
|
diff.insert(itr->first - prev->first);
|
|
itr++;
|
|
prev++;
|
|
}
|
|
}
|
|
|
|
int q;
|
|
cin >> q;
|
|
while (q--) {
|
|
int i;
|
|
ll x;
|
|
cin >> i >> x;
|
|
i--;
|
|
|
|
ll p = a[i];
|
|
a[i] = x;
|
|
|
|
auto itr = act.find(p);
|
|
itr->second--;
|
|
|
|
if (itr->second == 0) {
|
|
auto ne = next(itr);
|
|
|
|
if (itr != act.begin() && ne != act.end()) {
|
|
diff.insert(ne->first - prev(itr)->first);
|
|
}
|
|
|
|
if (itr != act.begin()) {
|
|
diff.erase(diff.find(itr->first - prev(itr)->first));
|
|
}
|
|
|
|
if (ne != act.end()) {
|
|
diff.erase(diff.find(ne->first - itr->first));
|
|
}
|
|
|
|
act.erase(itr);
|
|
}
|
|
|
|
act[x]++;
|
|
|
|
itr = act.find(x);
|
|
|
|
if (itr->second == 1) {
|
|
auto ne = next(itr);
|
|
|
|
if (ne != act.end() && itr != act.begin()) {
|
|
diff.erase(diff.find(ne->first - prev(itr)->first));
|
|
}
|
|
|
|
if (itr != act.begin()) {
|
|
diff.insert(itr->first - prev(itr)->first);
|
|
}
|
|
|
|
if (ne != act.end()) {
|
|
diff.insert(ne->first - itr->first);
|
|
}
|
|
}
|
|
|
|
cout << prev(act.end())->first + *prev(diff.end()) << " \n"[q == 0];
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
pre();
|
|
|
|
int t;
|
|
(TEST && cin >> t) || (t = 1);
|
|
while (t--) {
|
|
solve();
|
|
}
|
|
}
|