题意:
输入 n, m表初始有 n 个数, 接下来 m 行输入两种操作:
Q x y 表示询问区间 [x, y]的和;
C x y z 表示区间 [x, y] 内所有数加上 z 。
思路:
线段树模板题。区间更新,区间求和查询也可以用树状数组来做。
摘自:https://www.cnblogs.com/RabbitHu/p/BIT.html
先回顾区间更新,单点查询的树状数组。
再来看区间修改,区间查询的树状数组
树状数组代码:
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 100000+5;
using namespace std;
int n,m;
LL A[maxn], pre_sum[maxn];
LL C[2][maxn]; // C[0][]:维护差分数组delta[i]的前缀和;C[1][]:维护delta[i]*i的前缀和
inline int lowbit(int x){ return x & -x;}
void add(int u, int x, int v){for(int i = x; i <= n; i+= lowbit(i)) C[u][i]+= v;}
LL sum(int u, int x){
LL s = 0;
for(int i = x; i > 0; i-= lowbit(i)) s+= C[u][i];
return s;
}
int main()
{
freopen("in.txt","r",stdin);
char str[5];
int s, t, val;
LL ans;
while(scanf("%d%d",&n,&m) == 2){
memset(C, 0, sizeof(C));
for(int i = 1; i <= n; ++i) scanf("%lld",&A[i]);
pre_sum[0] = 0;
for(int i = 1; i <= n; ++i) pre_sum[i] = pre_sum[i-1] + A[i];
while(m--){
scanf("%s",str);
scanf("%d%d",&s,&t);
if(str[0] == 'C'){
scanf("%d", &val);
add(0, s, val);
add(0, t+1, -val);
add(1, s, val*s);
add(1, t+1, -val*(t+1));
}
else{
ans = pre_sum[t] - pre_sum[s-1]; // 原数组的前缀和
ans+= (t+1)*sum(0, t) - sum(1, t);
ans-= s*sum(0, s-1) - sum(1, s-1);
printf("%lld\n", ans);
}
}
}
fclose(stdin);
return 0;
}
线段树代码:
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
#define lson root << 1, l, mid
#define rson root << 1 | 1, mid+1, r
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 100000+5;
using namespace std;
int n,m;
int a[maxn]; // 原数组
LL lazy[maxn*4]; // lazy标签
LL Tree[maxn*4]; // 线段树
// 向上更新根节点
void push_up(int root){ Tree[root] = Tree[root<<1] + Tree[root<<1 | 1];}
// 线段树建树
void Stree_build(int root, int l, int r){
if(l == r){
scanf("%lld", &Tree[root]);
//Tree[root] = a[cnt++];
//printf("cnt = %d, %d\n",cnt-1,a[cnt-1]);
return;
}
int mid = (l+r)>>1;
Stree_build(lson);
Stree_build(rson);
push_up(root);
}
// 向下更新。root:结点下标。len:对应的当前[l,r]区间长度
void push_down(int root, int len){
if(0 == lazy[root]) return; // 这个节点根本没有lazy_tag
lazy[root<<1] += lazy[root];
lazy[root<<1 | 1] += lazy[root];
Tree[root<<1] += lazy[root] * (len-(len>>1));
Tree[root<<1 | 1] += lazy[root] * (len>>1);
lazy[root] = 0; // lazy标记已经向下传递了,去除父节点的Lazy标记
}
// la、rb为需更新的区间左、右端点,l、r为当前区间左、右端点,root为当前l、r对应的根存储位置
void update(int la, int rb, int l, int r, int root, LL val){
if(rb < l||la > r) return ; // 两区间无交集
if(la <= l&&rb >= r){ // [la,rb]包含[l,r]
Tree[root] += val * (r-l+1); // 这里是覆盖更新,也可以选择其他的更新操作
lazy[root] += val;
return ;
}
push_down(root, r-l+1);
int mid = (l+r)>>1;
if(la <= mid)
update(la, rb, l, mid, root<<1, val);
if(rb > mid)
update(la, rb, mid+1, r, root<<1 | 1, val);
push_up(root);
}
//查询区间[la,rb]的值
void Query(int la, int rb, int l, int r, int root, LL& ans){
if(rb < l||la > r) return; // 两区间无交集
if(la <= l&&rb >= r){ ans+= Tree[root]; return; } // [la,rb]包含[l,r]
push_down(root, r-l+1);
int mid = (l+r)/2;
if(la <= mid)
Query(la, rb, l, mid, root<<1, ans);
if(rb > mid)
Query(la, rb, mid+1, r, root<<1 | 1, ans);
push_up(root);
}
int main()
{
freopen("in.txt","r",stdin);
char str[5];
int x,y;
LL ans,val;
while(scanf("%d%d",&n,&m) == 2){
memset(Tree, 0, sizeof(Tree));
memset(lazy, 0, sizeof(lazy));
Stree_build(1, 1, n);//建树
while(m--){
scanf("%s",str);
if(str[0] == 'C'){
scanf("%d%d%lld",&x,&y,&val);
update(x, y, 1, n, 1, val);
}
else{
scanf("%d%d",&x,&y);
ans = 0;
Query(x, y, 1, n, 1, ans);
printf("%lld\n", ans);
}
}
}
fclose(stdin);
return 0;
}