hihoCoder---1488 : 排队接水【莫队+树状数组】

题目：

https://hihocoder.com/problemset/problem/1488?sid=1476371

分析：

对于每个区间，不难发现将该区间的时间从小到大排序后，依次接水是最优的，考虑离线后莫队算法处理，对于每次插入或删除一个数，只需计算出当前区间比它小的数的和，和比它大的数的个数，即可直接得到最小等待时间，用两个树状数组维护即可

代码：

#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
const int MAXN = 2e4+24;
int tree1[MAXN],tree2[MAXN],a[MAXN],n,m,block,T,L,R,MAX;
struct segment{
    int l,r,id;
}s[MAXN];
LL ans[MAXN],sum,num,res;
bool cmp(segment a,segment b){
    return a.r/block == b.r/block ? a.l < b.l : a.r < b.r;
}
inline int lowbit(int x){
    return x & (-x);
}
void Updata(int x,int val1,int val2){
    while(x <= n){
        tree1[x] += val1;
        tree2[x] += val2;
        x += lowbit(x);
    }
}
void Query(int x){
    while(x){
        sum += tree1[x];
        num += tree2[x];
        x -= lowbit(x);
    }
}
void add(int x){
    sum = 0,num = 0;
    Query(a[x]);
    res += sum + (R-L+1-num)*a[x];
    Updata(a[x],a[x],1);
}
void del(int x){
    sum = 0,num = 0;
    Query(a[x]);
    res = res - sum - (R-L+1-num)*a[x];
    Updata(a[x],-a[x],-1);
}
int main(){
    cin >> T;
    while(T--){
        cin >> n >> m;
        block = sqrt(n*1.0),res = 0;
        memset(tree1,0,sizeof(tree1));
        memset(tree2,0,sizeof(tree2));
        for(int i = 1;i <= n; ++i) cin >> a[i];
        for(int i = 1;i <= m; ++i) s[i].id = i,cin >> s[i].l >> s[i].r;
        sort(s+1,s+m+1,cmp);
        L = 1,R = 0,MAX = *max_element(a+1,a+1+n);
        for(int i = 1;i <= m; ++i){
            while(L < s[i].l) del(L),L++;
            while(L > s[i].l) --L,add(L);
            while(R < s[i].r) ++R,add(R);
            while(R > s[i].r) del(R),R--;
            ans[s[i].id] = res;
        }
        for(int i = 1;i <= m; ++i) cout << ans[i] << '\n';
    }
    return 0;
}