题目:
代码:
#include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
typedef long long ll;
inline ll read() {
//快读
ll ans = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c)) {
ans = ans * 10 + c - '0';
c = getchar();
}
return ans;
}
ll n, m, A[MAXN], tree[MAXN * 4], mark[MAXN * 4]; // 经验表明开四倍空间不会越界,tree用来存线段树,mark用来标记,A用来存原数组数值
inline void push_down(ll p, ll len) {
//延迟标记下推
mark[p * 2] += mark[p]; //标记下推左子节点