树状数组 & 线段树（待更）

1. 单点修改+区间查询

树状数组：

//Luogu 3374
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=5e5+4;
int n,m;
int s[N];
inline void add(int p,int d) {
	for (;p<=n;p+=p&-p) s[p]+=d;
}
inline int query(int p) {
	int ret=0;
	for (;p;p-=p&-p) ret+=s[p];
	return ret;
}
inline int read() {
	int x=0,f=1;char c=getchar();
	while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
	while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x*f;
}
int main() {
	n=read(),m=read();
	for (register int i=1;i<=n;++i) {
		int x=read();
		add(i,x);
	}
	for (register int i=0;i<m;++i) {
		int f=read(),x=read(),y=read();
		if (f&1) add(x,y);
		else printf("%d\n",query(y)-query(x-1));
	}
	return 0;
}

2. 区间修改+单点查询

树状数组：（差分）

//Luogu 3368
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=5e5+4;
int n,m;
int s[N];
inline void add(int p,int d) {
	for (;p<=n;p+=p&-p) s[p]+=d;
}
inline int query(int p) {
	int ret=0;
	for (;p;p-=p&-p) ret+=s[p];
	return ret;
}
inline int read() {
	int x=0,f=1;char c=getchar();
	while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
	while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x*f;
}
int main() {
	n=read(),m=read();
	for (register int i=1;i<=n;++i) {
		int x=read();
		add(i,x);
		add(i+1,-x);
	}
	for (register int i=0;i<m;++i) {
		int f=read();
		if (f&1) {
			int l=read(),r=read(),d=read();
			add(l,d);
			add(r+1,-d);
		} else {
			int p=read();
			printf("%d\n",query(p));
		}
	}
	return 0;
}

3. 区间修改+区间查询

线段树：（标记下传）

//poj 3468
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define root 1,1,n
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
typedef long long ll;
const int N=1e5+4;
int n,m;
ll sum[N<<2],laz[N<<2];
inline int read() {
	int x=0,f=1;char c=getchar();
	while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
	while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x*f;
}
inline void pushup(int rt) {
	sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
inline void pushdown(int rt,int len) {
	if (laz[rt]) {
		sum[rt<<1]+=laz[rt]*(len-(len>>1));
		sum[rt<<1|1]+=laz[rt]*(len>>1);
		laz[rt<<1]+=laz[rt];
		laz[rt<<1|1]+=laz[rt];
		laz[rt]=0;
	}
}
inline void modify(int rt,int l,int r,int L,int R,ll delta) {
	if (L<=l&&r<=R) {
		sum[rt]+=delta*(r-l+1);
		laz[rt]+=delta;
		return ;
	}
	pushdown(rt,r-l+1);
	int mid=l+r>>1;
	if (L<=mid) modify(lson,L,R,delta);
	if (mid<R) modify(rson,L,R,delta);
	pushup(rt);
}
inline ll query(int rt,int l,int r,int L,int R) {
	if (L<=l&&r<=R) return sum[rt];
	pushdown(rt,r-l+1);
	int mid=l+r>>1;
	ll ret=0;
	if (L<=mid) ret+=query(lson,L,R);
	if (mid<R) ret+=query(rson,L,R);
	return ret;
}
int main() {
	n=read(),m=read();
	for (register int i=1;i<=n;++i) {
		ll x=read();
		modify(root,i,i,x);
	}
	for (register int i=0;i<m;++i) {
		char f;
		while (!isalpha(f=getchar()));
		if (f^'C') {
			int x=read(),y=read();
			printf("%lld\n",query(root,x,y));
		} else {
			int x=read(),y=read();
			ll d=read();
			modify(root,x,y,d);
		}
	}
	return 0;
}