bzoj3064(历史最值)

题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=3064

思路：还是16年国家集训队jls的论文

 

#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<long long> VI;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define SZ(x) ((long long)(x).size())
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(1e9+7)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int n,m,a[100008],x,y,t,z;
char op[2];
struct Data{
    int a,b;
    void clear(){a=0;b=-inf;}
    int calc(int x){return max(a+x,b);}
};
struct as{
    int l,r,ma,maa;
    Data lz,lzz;
}tr[100008<<2];
Data max(Data a,Data b){return (Data){max(a.a,b.a),max(a.b,b.b)};}
Data operator+(Data a,Data b){return (Data){max(-inf,a.a+b.a),max(a.b+b.a,b.b)};}
void push(int d)
{
    tr[d].ma=max(tr[lc].ma,tr[rc].ma);
    tr[d].maa=max(tr[lc].maa,tr[rc].maa);
}
void build(int d,int l,int r)
{
    tr[d].l=l,tr[d].r=r;tr[d].lz.clear();tr[d].lzz.clear();
    if(l==r)  {tr[d].maa=tr[d].ma=a[l];return;}
    int mid=(l+r)>>1;
    build(lc,l,mid);
    build(rc,mid+1,r);
    push(d);
}
void puttag(int d,Data a,Data b)
{
    tr[d].lzz=max(tr[d].lzz,tr[d].lz+b);
    tr[d].lz=tr[d].lz+a;
    tr[d].maa=max(tr[d].maa,b.calc(tr[d].ma));
    tr[d].ma=a.calc(tr[d].ma);
}
void pushh(int d)
{
    puttag(lc,tr[d].lz,tr[d].lzz);
    puttag(rc,tr[d].lz,tr[d].lzz);
    tr[d].lz.clear(),tr[d].lzz.clear();
}
void add(int d,int l,int r,Data pos)
{
    if(tr[d].l==l&&tr[d].r==r) {puttag(d,pos,pos);return;}
    pushh(d);
    int mid=(tr[d].l+tr[d].r)>>1;
    if(mid>=r)  add(lc,l,r,pos);
    else if(l>mid)  add(rc,l,r,pos);
    else add(lc,l,mid,pos),add(rc,mid+1,r,pos);
    push(d);
}
int query(int d,int l,int r,int z)
{
    if(tr[d].l==l&&tr[d].r==r) return z?tr[d].ma:tr[d].maa;
    pushh(d);
    int mid=(tr[d].l+tr[d].r)>>1;
    if(mid>=r)  return query(lc,l,r,z);
    else if(l>mid)  return query(rc,l,r,z);
    else return max(query(lc,l,mid,z),query(rc,mid+1,r,z));
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    FOR(i,1,n) si(a[i]);
    build(1,1,n);
    cin>>m;
    while(m--)
    {
        ss(op),si(x),si(y);
        if(op[0]=='Q') printf("%d\n",query(1,x,y,1));
        else if(op[0]=='A') printf("%d\n",query(1,x,y,0));
        else if(op[0]=='P') si(z),add(1,x,y,Data{z,-inf});
        else si(z),add(1,x,y,Data{-inf,z});
    }
    return 0;
}