CPU监控 线段树裸题

//#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<cctype>
#include<utility>
#include<queue>
#include<map>
#include<set>
#include<bitset>
#include<deque>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<iomanip>
#include<stack>
#include<string>
#include<cstring>
#define INF 1000000000000ll
#define ll long long
#define db double
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
#define l(p) t[p].l
#define r(p) t[p].r
#define sum(p) t[p].sum
#define mx(p) t[p].mx
#define zz p<<1
#define yy p<<1|1
using namespace std;
char buf[1<<15],*fs,*ft;
inline char getc()
{
    return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;
}
inline ll read()
{
    ll x=0,f=1;char ch=getc();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getc();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getc();}
    return x*f;
}
const ll MAXN=100010;
ll n,m;
char ch;
struct wy
{
    ll l,r;
    ll mx;//历史最值
    ll sum;//当前最值
}t[MAXN<<2];
struct data
{
    ll x,y;
    data(ll a=0,ll b=-INF){x=a;y=b;}
    data operator +(const data &a){return data(max(-INF,x+a.x),max(y+a.x,a.y));}
    data operator *(const data &a){return data(max(x,a.x),max(y,a.y));}
}ntag[MAXN<<2],ptag[MAXN<<2];
inline void pushup(ll p)
{
    mx(p)=max(mx(zz),mx(yy));
    sum(p)=max(sum(zz),sum(yy));
}
inline void pushdown(ll p)
{
    ptag[zz]=ptag[zz]*(ntag[zz]+ptag[p]);
    ntag[zz]=ntag[zz]+ntag[p];
    mx(zz)=max(mx(zz),max(sum(zz)+ptag[p].x,ptag[p].y));
    sum(zz)=max(sum(zz)+ntag[p].x,ntag[p].y);
    ptag[yy]=ptag[yy]*(ntag[yy]+ptag[p]);
    ntag[yy]=ntag[yy]+ntag[p];
    mx(yy)=max(mx(yy),max(sum(yy)+ptag[p].x,ptag[p].y));
    sum(yy)=max(sum(yy)+ntag[p].x,ntag[p].y);
    ptag[p]=ntag[p]=data();
}
inline void build(ll p,ll l,ll r)
{
    l(p)=l;r(p)=r;
    if(l==r)
    {
        mx(p)=read();sum(p)=mx(p);
        return;
    }
    ll mid=(l+r)>>1;
    build(zz,l,mid);
    build(yy,mid+1,r);
    pushup(p);
}
inline void change(ll p,ll l,ll r,data a)
{
    if(l<=l(p)&&r>=r(p))
    {
        ntag[p]=ntag[p]+a;
        ptag[p]=ptag[p]*ntag[p];
        sum(p)=max(sum(p)+a.x,a.y);
        mx(p)=max(mx(p),sum(p));
        return;
    }
    ll mid=(l(p)+r(p))>>1;
    pushdown(p);
    if(l<=mid)change(zz,l,r,a);
    if(r>mid)change(yy,l,r,a);
    pushup(p);
}
inline ll ask(ll p,ll l,ll r,ll flag)
{
    if(l<=l(p)&&r>=r(p))return flag?mx(p):sum(p);
    pushdown(p);
    ll mid=(l(p)+r(p))>>1,ans=-INF,w=-INF;
    if(l<=mid)ans=ask(zz,l,r,flag);
    if(r>mid)w=ask(yy,l,r,flag);
    return max(ans,w);
}
signed main()
{
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    n=read();
    build(1,1,n);
    m=read();
    for(ll i=1;i<=m;++i)
    {
        ll x,y,z;
        ch=getc();
        while(ch!=‘Q‘&&ch!=‘A‘&&ch!=‘P‘&&ch!=‘C‘)ch=getc();
        x=read();y=read();
        if(ch==‘Q‘)printf("%lld\n",ask(1,x,y,0));
        if(ch==‘A‘)printf("%lld\n",ask(1,x,y,1));
        if(ch==‘P‘)z=read(),change(1,x,y,data(z,-INF));
        if(ch==‘C‘)z=read(),change(1,x,y,data(-INF,z));
    }
    return 0;
}