4826: [Hnoi2017]影魔

题目链接

对于每组询问，分别考虑$p_1$类型和$p_2$类型对答案的贡献
预处理$pre_i$表示在灵魂$i$左边第一个战斗力比它大的灵魂
类似的预处理$nex_i$
那么，所有满足贡献为$p_1$的点对，显然可以写做$(pre_i,i)$或$(i,nex_i)$
那么每次询问，只需要知道一个区间内$pre_i$大于某值的数量
以及$nex_i$小于某值的数量，就知道$p_1$类型的贡献了
对于$p_2$类型，考虑每个点作为较大的端点时的数量
对于属于$(i,nex_i)$的每个点$k$，只要$i < pre_k$那么$(i,k)$的贡献显然是$p_2$
显然不存在$pre_k < i$的情形
而对于$pre_k == i$，$(i,k)$的贡献显然是$p_1$了
记贡献为$p_1$的点对有$x$对
那么贡献为$p_2$的点对可以这样算出
$\sum_{i=l}^r(i-max(pre_i,l)-1+min(nex_i,r)-i-1)\ -\ x$
因为每对贡献为$p_1$的点对仅会被减去1次
这些东西都能用主席树维护出来

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;

const int T = 19;
const int maxn = 4E5 + 40;
typedef long long LL;

int n,m,p1,p2,cnt,cl,cr,tp,A[maxn],stk[maxn],L[maxn],R[maxn]
    ,rt[maxn],lc[maxn*T],rc[maxn*T],sizl[maxn*T],sizr[maxn*T];
LL suml,sumr,sl[maxn*T],sr[maxn*T];

inline int Insert_L(int o,int l,int r,int pos)
{
    int ret = ++cnt;
    sizl[ret] = sizl[o] + 1; sizr[ret] = sizr[o];
    sl[ret] = sl[o] + 1LL * pos; sr[ret] = sr[o];
    if (l == r) return ret; int mid = l + r >> 1;
    if (pos <= mid) lc[ret] = Insert_L(lc[o],l,mid,pos),rc[ret] = rc[o];
    else rc[ret] = Insert_L(rc[o],mid+1,r,pos),lc[ret] = lc[o];
    return ret;
}

inline int Insert_R(int o,int l,int r,int pos)
{
    int ret = ++cnt;
    sizl[ret] = sizl[o]; sizr[ret] = sizr[o] + 1;
    sl[ret] = sl[o]; sr[ret] = sr[o] + 1LL * pos;
    if (l == r) return ret; int mid = l + r >> 1;
    if (pos <= mid) lc[ret] = Insert_R(lc[o],l,mid,pos),rc[ret] = rc[o];
    else rc[ret] = Insert_R(rc[o],mid+1,r,pos),lc[ret] = lc[o];
    return ret;
}

inline void Query_L(int o,int l,int r,int pos,LL tmp)
{
    if (l >= pos)
    {
        cl += tmp * sizl[o];
        suml += tmp * sl[o];
        return;
    }
    int mid = l + r >> 1;
    Query_L(rc[o],mid+1,r,pos,tmp);
    if (pos <= mid) Query_L(lc[o],l,mid,pos,tmp);
}

inline void Query_R(int o,int l,int r,int pos,LL tmp)
{
    if (r <= pos)
    {
        cr += tmp * sizr[o];
        sumr += tmp * sr[o];
        return;
    }
    int mid = l + r >> 1;
    Query_R(lc[o],l,mid,pos,tmp);
    if (mid < pos) Query_R(rc[o],mid+1,r,pos,tmp);
}

inline void Work(int l,int r)
{
    Query_L(rt[r],0,n + 1,l,1);
    Query_R(rt[r],0,n + 1,r,1);
    if (l > 1)
    {
        Query_L(rt[l - 1],0,n + 1,l,-1);
        Query_R(rt[l - 1],0,n + 1,r,-1);
    }
}

inline int getint()
{
    char ch = getchar(); int ret = 0;
    while (ch < '0' || '9' < ch) ch = getchar();
    while ('0' <= ch && ch <= '9')
        ret = ret * 10 + ch - '0',ch = getchar();
    return ret;
}

int main()
{
    #ifdef DMC
        freopen("DMC.txt","r",stdin);
        freopen("test.txt","w",stdout);
    #endif

    n = getint(); m = getint(); p1 = getint(); p2 = getint();
    for (int i = 1; i <= n; i++) A[i] = getint();
    for (int i = 1; i <= n; i++)
    {
        while (tp && A[stk[tp]] < A[i]) --tp;
        L[i] = stk[tp]; stk[++tp] = i;
    }
    tp = 0;
    for (int i = n; i; i--)
    {
        while (tp && A[stk[tp]] < A[i]) --tp;
        R[i] = tp ? stk[tp] : n + 1; stk[++tp] = i;
    }
    for (int i = 1; i <= n; i++)
    {
        rt[i] = Insert_L(rt[i - 1],0,n + 1,L[i]);
        rt[i] = Insert_R(rt[i],0,n + 1,R[i]);
    }
    while (m--)
    {
        int l = getint(),r = getint();
        suml = sumr = cl = cr = 0;
        Work(l,r); LL t1 = cl + cr,t2;
        int tl = r - l + 1 - cl,tr = r - l + 1 - cr;
        t2 = sumr - suml + 1LL * (r + 1) * tr - 1LL * (l - 1) * tl - 2LL * (r - l + 1) - t1;
        printf("%lld\n",1LL * p1 * t1 + 1LL * p2 * t2);
    }
    return 0;
}