Can you answer these queries III 【SPOJ - GSS3】【带修最大子段和】

题目链接

---

  我们只需要在GSS1上面加上一个单点修改的update()函数即可了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define max3(a, b, c) max(a, max(b, c))
#define max6(a, b, c, d, f, g) max(max3(a, b, c), max3(d, f, g))
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 5e4 + 7;
int N, Q;
struct Tree
{
    ll lm, rm, mx, all;
    Tree(ll a=0, ll b=0, ll c=0, ll d=0):lm(a), rm(b), mx(c), all(d) {}
    void give(ll x) { lm = rm = mx = all = x; }
}tree[maxN<<2];
inline void pushup(int rt)
{
    if(tree[lsn].lm > tree[rsn].lm + tree[lsn].all) tree[rt].lm = tree[lsn].lm;
    else tree[rt].lm = tree[rsn].lm + tree[lsn].all;
    if(tree[rsn].rm > tree[rsn].all + tree[lsn].rm) tree[rt].rm = tree[rsn].rm;
    else tree[rt].rm = tree[rsn].all + tree[lsn].rm;
    tree[rt].all = tree[lsn].all + tree[rsn].all;
    tree[rt].mx = max6(tree[lsn].mx, tree[rsn].mx, tree[rt].lm, tree[rt].rm, tree[rt].all, tree[lsn].rm + tree[rsn].lm);
}
void buildTree(int rt, int l, int r)
{
    if(l == r)
    {
        scanf("%lld", &tree[rt].all);
        tree[rt].give(tree[rt].all);
        return;
    }
    int mid = HalF;
    buildTree(Lson); buildTree(Rson);
    pushup(rt);
}
Tree query(int rt, int l, int r, int ql, int qr)
{
    if(ql <= l && qr >= r) return tree[rt];
    int mid = HalF;
    if(qr <= mid) return query(QL);
    else if(ql > mid) return query(QR);
    else
    {
        Tree ans, TL = query(QL), TR = query(QR);
        if(TL.lm > TR.lm + TL.all) ans.lm = TL.lm;
        else ans.lm = TR.lm + TL.all;
        if(TR.rm > TR.all + TL.rm) ans.rm = TR.rm;
        else ans.rm = TR.all + TL.rm;
        ans.all = TL.all + TR.all;
        ans.mx = max6(TL.mx, TR.mx, ans.lm, ans.rm, ans.all, TL.rm + TR.lm);
        return ans;
    }
}
void update(int rt, int l, int r, int qx, ll val)
{
    if(l == r)
    {
        tree[rt].give(val);
        return;
    }
    int mid = HalF;
    if(qx <= mid) update(Lson, qx, val);
    else update(Rson, qx, val);
    pushup(rt);
}
int main()
{
    scanf("%d", &N);
    buildTree(1, 1, N);
    scanf("%d", &Q);
    int op, l, r;
    while(Q--)
    {
        scanf("%d%d%d", &op, &l, &r);
        if(!op) update(1, 1, N, l, r);
        else printf("%lld\n", query(1, 1, N, l, r).mx);
    }
    return 0;
}