【BZOJ4826】【HNOI2017】影魔（线段树）

Description

click me

Solution

参考了dyx的博客
%%%

用单调栈的方式处理出每个位置左右第一个比他大的数的位置
对于每对lef[i]和rig[i]都会做出p1的贡献
每个lef[i]会对i+1到rig[i]−1做出p2贡献
同理，每个rig[i]都会给lef[i]+1到i−1做出p2贡献

Source

/************************************************
 * Au: Hany01
 * Date: Mar 3rd, 2018
 * Prob: [BZOJ4826][HNOI2017] 影魔
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("bzoj4826.in", "r", stdin);
    freopen("bzoj4826.out", "w", stdout);
#endif
}

const int maxn = 200005;

int n, m, tot, cnt, stk[maxn], top, a[maxn], L[maxn], R[maxn];
LL Ans[maxn], p1, p2;

struct Segment_Tree
{
    LL sum[maxn << 2], tag[maxn << 2], dt;
    int x, y;

#define lc (t << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)

    inline void pushdown(int t, int l, int r) {
        sum[lc] += tag[t] * (mid - l + 1), sum[rc] += tag[t] * (r - mid);
        tag[lc] += tag[t], tag[rc] += tag[t], tag[t] = 0;
    }

    inline void maintain(int t) { sum[t] = sum[lc] + sum[rc]; }

    void update(int t, int l, int r) {
        if (x <= l && r <= y) { tag[t] += dt, sum[t] += (r - l + 1) * dt; return ; }
        pushdown(t, l, r);
        if (x <= mid) update(lc, l, mid);
        if (y >  mid) update(rc, mid + 1, r);
        maintain(t);
    }

    LL query(int t, int l, int r) {
        if (x <= l && r <= y) return sum[t];
        pushdown(t, l, r);
        if (y <= mid) return query(lc, l, mid);
        if (x >  mid) return query(rc, mid + 1, r);
        return query(lc, l, mid) + query(rc, mid + 1, r);
    }
}ST;

struct Segment
{
    int x, l, r;
    LL dt;
    Segment(int x = 0, int l = 0, int r = 0, LL dt = 0): x(x), l(l), r(r), dt(dt) {}
}seg[maxn * 3];
bool operator < (const Segment& A, const Segment& B) { return A.x < B.x; }

struct Question
{
    int id, x, l, r, type;
    Question(int id = 0, int x = 0, int l = 0, int r = 0, int type = 0): id(id), x(x), l(l), r(r), type(type) {}
}Q[maxn << 1];
bool operator < (const Question& A, const Question& B) { return A.x < B.x; }

inline void Init()
{
    n = read(), m = read(), p1 = read(), p2 = read();
    For(i, 1, n) a[i] = read();
    a[0] = INF, a[n + 1] = INF;

    stk[top = 1] = 0;
    For(i, 1, n) {
        while (a[i] > a[stk[top]]) -- top;
        L[i] = stk[top], stk[++ top] = i;
    }
    stk[top = 1] = n + 1;
    Fordown(i, n, 1) {
        while (a[i] > a[stk[top]]) -- top;
        R[i] = stk[top], stk[++ top] = i;
    }

    For(i, 1, n) {
        if (0 < L[i] && R[i] <= n) seg[++ cnt] = Segment(L[i], R[i], R[i], p1);
        if (i + 1 < R[i] && L[i] > 0) seg[++ cnt] = Segment(L[i], i + 1, R[i] - 1, p2);
        if (L[i] + 1 < i && R[i] <= n) seg[++ cnt] = Segment(R[i], L[i] + 1, i - 1, p2);
    }
    sort(seg + 1, seg + 1 + cnt);


    static int l, r;
    For(i, 1, m) {
        l = read(), r = read(), Ans[i] = (r - l) * p1;
        if (l > 1) Q[++ tot] = Question(i, l - 1, l, r, -1);
        Q[++ tot] = Question(i, r, l, r, 1);
    }
    sort(Q + 1, Q + 1 + tot);
}

inline void Solve()
{
    static int pos1 = 1, pos2 = 1;
    For(i, 1, n) {
        while (seg[pos1].x == i)
            ST.x = seg[pos1].l, ST.y = seg[pos1].r, ST.dt = seg[pos1].dt, ST.update(1, 1, n), ++ pos1;
        while (Q[pos2].x == i)
            ST.x = Q[pos2].l, ST.y = Q[pos2].r, Ans[Q[pos2].id] += ST.query(1, 1, n) * Q[pos2].type, ++ pos2;
    }

    For(i, 1, m) printf("%lld\n", Ans[i]);
}

int main()
{
    File();

    Init();

    Solve();

    return 0;
}
//酌酒以自宽，举杯断绝歌路难。
//    -- 鲍照《拟行路难·其四》