hgfh

// 区间增减，区间查询

#include <cstdio>
#include <algorithm>
using namespace std;

#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
const int MAXN = 最大n;
const int INF = 0x3f3f3f3f;

int SUM[MAXN<<2], MIN[MAXN<<2], MAX[MAXN<<2];
int lazy[MAXN<<2];

void PushUp(int rt) {
        SUM[rt] = SUM[rt<<1] + SUM[rt<<1|1];
        MIN[rt] = min(MIN[rt<<1], MIN[rt<<1|1]);
        MAX[rt] = max(MAX[rt<<1], MAX[rt<<1|1]);
}

void PushDown(int rt, int m) {
        if(lazy[rt]) {
                lazy[rt<<1] += lazy[rt];
                lazy[rt<<1|1] += lazy[rt];
                SUM[rt<<1] += lazy[rt] * (m - (m >> 1));
                SUM[rt<<1|1] += lazy[rt] * (m >> 1);
                MIN[rt<<1] += lazy[rt];
                MIN[rt<<1|1] += lazy[rt];
                MAX[rt<<1] += lazy[rt];
                MAX[rt<<1|1] += lazy[rt];
                lazy[rt] = 0;
        }
}

// 以下的 l, r, rt 带入 1, n, 1
void Build(int l, int r, int rt) {
        lazy[rt] = 0;
        if(l == r) {
                // 初始化树为 0 的写法
                SUM[rt] = MIN[rt] = MAX[rt] = 0;
                // 边读入边建树的写法
                // scanf("%d", &SUM[rt]);
                // MIN[rt] = MAX[rt] = SUM[rt];
                return;
        }
        int m = (l + r) >> 1;
        Build(lson);
        Build(rson);
        PushUp(rt);
}

// 将区间 L~R 的值增加 v
void Update(int L, int R, int v, int l, int r, int rt) {
        if(L<=l && r<=R) {
                lazy[rt] += v;
                SUM[rt] += v * (r - l + 1);
                MIN[rt] += v;
                MAX[rt] += v;
                return;
        }
        PushDown(rt, r-l+1);
        int m = (l + r) >> 1;
        if(L <= m) Update(L, R, v, lson);
        if(R > m) Update(L, R, v, rson);
        PushUp(rt);
}

// 求区间 L~R 的和
int QuerySum(int L, int R, int l, int r, int rt) {
        if(L<=l && r<=R) return SUM[rt];
        PushDown(rt, r-l+1);
        int m = (l + r) >> 1;
        int ret = 0;
        if(L <= m) ret += QuerySum(L, R, lson);
        if(R > m) ret += QuerySum(L, R, rson);

        return ret;
}

// 求区间 L~R 的最小值
int QueryMin(int L, int R, int l, int r, int rt) {
        if(L<=l && r<=R) return MIN[rt];
        PushDown(rt, r-l+1);
        int m = (l + r) >> 1;
        int ret = INF;
        if(L <= m) ret = min(ret, QueryMin(L, R, lson));
        if(R > m) ret = min(ret, QueryMin(L, R, rson));

        return ret;
}

// 求区间 L~R 的最大值
int QueryMax(int L, int R, int l, int r, int rt) {
        if(L<=l && r<=R) return MAX[rt];
        PushDown(rt, r-l+1);
        int m = (l + r) >> 1;
        int ret = -INF;
        if(L <= m) ret = max(ret, QueryMax(L, R, lson));
        if(R > m) ret = max(ret, QueryMax(L, R, rson));

        return ret;
}