D - Welfare State（线段树）

https://codeforces.com/contest/1199/problem/D

思路：维护区间最值，单点修改，单点不打tag，对于每次的区间操作打tag并且注意下tag的传递关系

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+100;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
struct Tree{
     LL l,r,val,tag;
}tree[maxn*4];
LL a[maxn];
inline push_down(LL p){
     if(tree[p].tag!=-1){
        tree[p*2].val=max(tree[p*2].val,tree[p].tag);
        tree[p*2+1].val=max(tree[p*2+1].val,tree[p].tag);
        tree[p*2].tag=max(tree[p].tag,tree[p*2].tag);
        tree[p*2+1].tag=max(tree[p].tag,tree[p*2+1].tag);
        tree[p].tag=-1;
     }
}
inline void build(LL p,LL l,LL r){
     tree[p].l=l;tree[p].r=r;tree[p].val=tree[p].tag=-1;
     if(l==r){tree[p].val=a[l];return;}
     LL mid=(l+r)>>1;
     build(p*2,l,mid);build(p*2+1,mid+1,r);
}
inline void modify(LL p,LL l,LL r,LL d){
     if(tree[p].l==tree[p].r){
        tree[p].val=d;return;///直接修改不管tag
     }
     push_down(p);
     LL mid=(tree[p].l+tree[p].r)>>1;
     if(l<=mid) modify(p*2,l,r,d);
     if(r>mid) modify(p*2+1,l,r,d);
     return;
}
inline void change(LL p,LL l,LL r,LL d){
     tree[1].tag=max(tree[1].tag,d);
     tree[1].val=max(tree[1].val,tree[1].tag);
     return;
}
inline query(LL p,LL l,LL r){
     if(tree[p].l==tree[p].r){
        return tree[p].val;
     }
     push_down(p);
     LL mid=(tree[p].l+tree[p].r)>>1;
     LL ans=-1;
     if(l<=mid) return query(p*2,l,r);
     if(r>mid) return query(p*2+1,l,r);
}
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    for(LL i=1;i<=n;i++) cin>>a[i];
    build(1,1,n);
    LL m;cin>>m;
    for(LL i=1;i<=m;i++){
        LL op;cin>>op;
        if(op==1){
            LL pos,x;cin>>pos>>x;
            modify(1,pos,pos,x);
        }
        else{
            LL x;cin>>x;
            change(1,1,n,x);
        }
    }
    for(LL i=1;i<=n;i++){
        printf("%d ",query(1,i,i));
    }printf("\n");
   	return 0;
}