题目链接:https://www.luogu.com.cn/problem/P4559
今天刚学了主席树。
看到这道题,求编号
[
l
,
r
]
[l,r]
[l,r]的贡献,看起来和还是很像主席树
不难看出,在移动过程中,不改变相对位置一定是最优的(之一)
运用主席树解决问题时,维护的数据一般要具备区间可减性
首先按编号建
r
o
o
t
root
root,不断更新值
在
u
p
d
a
t
e
update
update过程中要维护两个值,一个是位置在
[
l
,
r
]
[l,r]
[l,r]之间的个数,另一个是这些位置的和。
至于查询的时候,如果在某一区间内的人都要向左跑或者向右跑,可以推式子一步求解。
对于既有向左跑的,又有向右跑的,递归子树。
注意: 在递归右子树时,
k
k
k的位置也要发生变化(详见代码)
C o d e Code Code
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define int long long
const int MAXN = 5e5;
struct node{
int lc, rc, cnt;
long long s;
}tree[MAXN * 32 + 10];
int a[MAXN + 10], b[MAXN + 10], root[MAXN + 10], tot = 0;
inline int read();
int build(int, int);
inline void pushup(int);
int update(int, int, int, int);
long long query(int, int, int, int, int);
signed main(){
freopen ("std.in", "r", stdin);
freopen ("std.out", "w", stdout);
int n, m, len;
n = read(), m = read();
for (register int i = 1; i <= n; ++i) a[i] = read(), b[i] = a[i];
sort(b + 1, b + n + 1);
len = unique(b + 1, b + n + 1) - (b + 1);
root[0] = build(1, len);
for (register int i = 1; i <= n; ++i){
a[i] = lower_bound(b + 1, b + len + 1, a[i]) - b;
root[i] = update(root[i - 1], 1, len, a[i]);
}
for (register int i = 1; i <= m; ++i){
int l = read(), r = read(), k = read();
printf("%lld\n", query(root[r], root[l - 1], 1, len, k));
}
return 0;
}
inline int read(){
int x = 0;
char c = getchar();
while (!isdigit(c))c = getchar();
while (isdigit(c))x = (x << 1) + (x << 3) + (c & 15), c = getchar();
return x;
}
int build(int l, int r){
int p = ++tot;
if (l == r){
tree[p].s = 0;
return p;
}
int mid = l + r >> 1;
tree[p].lc = build(l, mid);
tree[p].rc = build(mid + 1, r);
tree[p].s = 0;
return p;
}
inline void pushup(int p){
tree[p].s = tree[tree[p].lc].s + tree[tree[p].rc].s;
tree[p].cnt = tree[tree[p].lc].cnt + tree[tree[p].rc].cnt;
}
int update(int now, int l, int r, int x){
int p = ++tot;
tree[p] = tree[now];
if (l == r){
tree[p].s += b[l];
++tree[p].cnt;
return p;
}
int mid = l + r >> 1;
if (x <= mid) tree[p].lc = update(tree[now].lc, l, mid, x);
else tree[p].rc = update(tree[now].rc, mid + 1, r, x);
pushup(p);
return p;
}
long long query(int p, int q, int l, int r, int k){
int num = tree[p].cnt - tree[q].cnt;
if (!num) return 0;
if (b[r] <= k) return num * k + num * (num - 1) / 2 - (tree[p].s - tree[q].s);
if (b[l] >= k) return tree[p].s - tree[q].s - num * k - num * (num - 1) / 2;
int mid = l + r >> 1, numl = tree[tree[p].lc].cnt - tree[tree[q].lc].cnt;
return query(tree[p].lc, tree[q].lc, l, mid, k) + query(tree[p].rc, tree[q].rc, mid + 1, r, k + numl);
}