题意:给定n个村民的经济状态,有两种操作:
- 1 x y:村民x的经济变为y
- 2 x:所有经济小于x的村民经济变为x
求出在q个操作后所有村民的经济状态
思路:单点修改+区间修改,单点查询,由于只用到了叶子节点存储答案,且区间值与最终答案无关,故区间值不需存储状态,可以用作Lazy标记,并去掉pushup操作。区间修改相当于将1到n区间内的值变为当前值和x的较大值,直接修改第一个节点即可。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 4e6+5;
const int inf = 0x3f3f3f3f;
int n, a[maxn], q, tr[maxn];
void pushdown(int p)
{
if (tr[p]) {
tr[p<<1] = max(tr[p<<1], tr[p]);
tr[p<<1|1] = max(tr[p<<1|1], tr[p]);
tr[p] = 0;
}
}
void build(int l, int r, int p)
{
if (l == r) {
tr[p] = a[l];
return;
}
int mid = (l+r)>>1;
build(l, mid, p<<1);
build(mid+1, r, p<<1|1);
}
void update(int k, int x, int l, int r, int p)
{
if (l == r) {
tr[p] = k;
return;
}
int mid = (l+r)>>1;
pushdown(p);
if (x <= mid)
update(k, x, l, mid, p<<1);
else
update(k, x, mid+1, r, p<<1|1);
}
int query(int x, int l, int r, int p)
{
if (x > r || x < l) return 0;
if (l == r) {
return tr[p];
}
int mid = (l+r)>>1;
pushdown(p);
int ans = max(query(x, l, mid, p<<1), query(x, mid+1, r, p<<1|1));
return ans;
}
int main()
{
cin >> n;
memset(tr, 0, sizeof(tr));
for (int i = 1; i <= n; i++)
cin >> a[i];
build(1, n, 1);
cin >> q;
int maxx = 0;
for (int i = 1; i <= q; i++) {
int op, x, y;
cin >> op;
if (op == 1) {
cin >> x >> y;
update(y, x, 1, n, 1);
} else {
cin >> x;
tr[1] = max(tr[1], x);
}
}
for (int i = 1; i <= n; i++) {
printf("%d ", query(i, 1, n, 1));
}
cout << "\n";
return 0;
}