2023年沈阳站K. Maximum Rating
题目中给出的元素均为每一轮 r a t i n g rating rating的变化值,要求带修地求出最大 r a t i n g rating rating变化次数可以有多少值。
贪心地考虑如何对序列进行排列,要使变化次数最少,应该先掉分在上分,并且在上分时,应该先放置涨幅较小的。
要使变化次数最多,就应该先上分再掉分,这样每次上分时都必然能够增加一次变化次数。
钦定 k k k为正数中前 k k k小数的和不大于所有负数绝对值的最大取值、正数有 s i z siz siz个,那么变化次数最多为 s i z siz siz,变化次数最少为 s i z − k siz-k siz−k,所以 k k k可取的值有 k + 1 k + 1 k+1个。
既然带修并且要求前 k k k小数的和,那么可以使用权值线段树, I n f o Info Info中维护当前值有多少且这个值加权之后是多少就好了。
至于要最大化 k k k,所以考虑二分。
时间复杂度 O ( q l o g 2 n ) O(qlog^{2}n) O(qlog2n)
#include <bits/stdc++.h>
std::vector<int> mask;
using i64 = long long;
template<class Info>
struct SegmentTree {
int n;
std::vector<Info> info;
SegmentTree() : n(0) {}
SegmentTree(int n_, Info v_ = Info()) {
init(n_, v_);
}
template<class T>
SegmentTree(std::vector<T> init_) {
init(init_);
}
void init(int n_, Info v_ = Info()) {
init(std::vector(n_, v_));
}
template<class T>
void init(std::vector<T> init_) {
n = init_.size();
info.assign(4 << std::__lg(n), Info());
std::function<void(int, int, int)> build = [&](int p, int l, int r) {
if (r - l == 1) {
info[p] = init_[l];
return;
}
int m = (l + r) / 2;
build(2 * p, l, m);
build(2 * p + 1, m, r);
pull(p);
};
build(1, 0, n);
}
void pull(int p) {
info[p] = info[2 * p] + info[2 * p + 1];
}
void modify(int p, int l, int r, int x, const Info &v) {
if (r - l == 1) {
info[p].x += v.x;
info[p].sum += v.x * v.sum;
return;
}
int m = (l + r) / 2;
if (x < m) {
modify(2 * p, l, m, x, v);
} else {
modify(2 * p + 1, m, r, x, v);
}
pull(p);
}
void modify(int p, const Info &v) {
modify(1, 0, n, p, v);
}
i64 rangeQuery(int p, int l, int r, int x, int y, int k) {
if (r - l == 1) {
if (info[p].x <= k) {
return info[p].sum;
} else {
return info[p].sum / info[p].x * k;
}
}
int m = (l + r) / 2;
i64 ans = 0;
if (info[p * 2].x <= k) {
ans += info[p * 2].sum + rangeQuery(p * 2 + 1, m, r, x, y, k - info[p * 2].x);
} else {
ans += rangeQuery(p * 2, l, m, x, y, k);
}
return ans;
}
i64 rangeQuery(int l, int r, int k) {
return rangeQuery(1, 0, n, l, r, k);
}
};
struct Info {
i64 x = 0;
i64 sum = 0;
};
Info operator+(const Info& a, const Info& b) {
Info c;
c.x = a.x + b.x;
c.sum = a.sum + b.sum;
return c;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, q;
std::cin >> n >> q;
int cntpos = 0;
i64 neg = 0;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
if (a[i] < 0) {
neg += -a[i];
} else {
mask.push_back(a[i]);
cntpos += 1;
}
}
// std::cerr << "NO";
std::vector<std::pair<int, int>> query(q);
for (int i = 0; i < q; i++) {
int x, v;
std::cin >> x >> v;
x--;
query[i] = {x, v};
if (v > 0) {
mask.push_back(v);
}
}
std::sort(mask.begin(), mask.end());
mask.erase(std::unique(mask.begin(), mask.end()), mask.end());
int siz = int(mask.size());
if (siz == 0) {
for (int i = 0; i < q; i++) {
std::cout << "1\n";
}
return 0;
}
SegmentTree<Info> seg(siz);
for (int i = 0; i < n; i++) {
if (a[i] > 0) {
int p = std::lower_bound(mask.begin(), mask.end(), a[i]) - mask.begin();
// std::cerr << "p: " << p << " mask: " << mask[p] << "\n";
seg.modify(p, {1, mask[p]});
}
}
// std::cerr << seg.rangeQuery(0, siz, 1) << "\n";
for (auto [x, val] : query) {
// std::cerr << "DEBUG\n";
if (a[x] > 0) {
int p = std::lower_bound(mask.begin(), mask.end(), a[x]) - mask.begin();
// std::cerr << "p: " << p << " mask: " << mask[p] << "\n";
seg.modify(p, {-1, mask[p]});
cntpos -= 1;
} else {
neg += a[x];
}
if (val > 0) {
int q = std::lower_bound(mask.begin(), mask.end(), val) - mask.begin();
// std::cerr << "q: " << q << " mask: " << mask[q] << "\n";
seg.modify(q, {1, mask[q]});
cntpos += 1;
} else {
neg -= val;
}
a[x] = val;
// if (cntpos == 0) {
// std::cout << "1\n";
// continue;
// }
// std::cerr << seg.rangeQuery(0, siz, 3) << "\n";
auto check = [&](int x) {
// std::cerr << "x: " << x << " sum: " << seg.rangeQuery(0, siz, x) << "\n";
return seg.rangeQuery(0, siz, x) <= neg;
};
// std::cerr << "cntpos: " << cntpos << "\n";
// std::cerr << "neg: " << neg << "\n";
int lo = 0, hi = cntpos + 1;
// std::cerr << lo << " " << hi << "\n";
while (hi - lo != 1) {
// std::cerr << lo << " " << hi << "\n";
int m = (lo + hi) / 2;
if (check(m)) {
lo = m;
} else {
hi = m;
}
}
std::cout << hi << "\n";
}
return 0;
}