2021-04-12线段树模板练习

A - 树状数组 1 ：单点修改，区间查询

1.题意：

2.题解：

3.ac代码：

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e6+10;
int a[N];
struct segmentTree{
	#define lson (node<<1)
	#define rson (node<<1|1)
	ll sum[N<<2],lazy[N<<2];
	void pushup(int node){
		sum[node]=sum[lson]+sum[rson];
	}
	void build(int node,int l,int r){
		if(l==r){
			sum[node]=a[l];
			return;
		}
		int mid=l+r>>1;
		build(lson,l,mid);
		build(rson,mid+1,r);
		pushup(node);
		  
	}
	void change(int node,int l,int r,int idx,int x){
		if(l==r){
			sum[node]+=x;
			return;
		}
		int mid=l+r>>1;
		if(idx<=mid){
			 change(lson,l,mid,idx,x);
		}else{
			 change(rson,mid+1,r,idx,x);
		}
		pushup(node);
	}
	ll query(int node,int l,int r,int L,int R){
		if(l==L&&r==R){
			return sum[node];
		}
		int mid=l+r>>1;
		if(R<=mid)
		  return query(lson,l,mid,L,R);
		else if(L>mid)
		  return query(rson,mid+1,r,L,R);
		else{
			ll ans=0;
			ans+=query(lson,l,mid,L,mid);
			ans+=query(rson,mid+1,r,mid+1,R);
			return ans;
		}
	}
}tree; 
int main(){
	int n,q;
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++)
	   scanf("%d",&a[i]);
	tree.build(1,1,n);
	for(int i=1;i<=q;i++){
		int t,j,x,l,r;
		scanf("%d",&t);
		if(t==1){
			scanf("%d%d",&j,&x);
			tree.change(1,1,n,j,x);
		}
		if(t==2){
			scanf("%d%d",&l,&r);
			ll ans=tree.query(1,1,n,l,r);
			printf("%lld\n",ans);
		}
	}
}

B - 树状数组 2 ：区间修改，单点查询

1.题意：

2.题解：

3.ac代码：

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e6+10;
int a[N];
struct segmentTree{
	#define lson (node<<1)
	#define rson (node<<1|1)
	ll sum[N<<2],lazy[N<<2];
	void spread(int node,int l,int r){//下放 
		int mid=(r+l)>>1;
		if(lazy[node]!=0){
			sum[lson]+=lazy[node]*(mid-l+1);
			sum[rson]+=lazy[node]*(r-(mid+1)+1);
			lazy[lson]+=lazy[node];
			lazy[rson]+=lazy[node];
			lazy[node]=0;
		
		}
		
		
	}
	void pushup(int node){//回溯 
		sum[node]=sum[lson]+sum[rson];
	}
	void build(int node,int l,int r){//创建树 
		lazy[node]=0;
		if(l==r){
			sum[node]=a[l];
			return;
		}
		int mid=l+r>>1;
		build(lson,l,mid);
		build(rson,mid+1,r);
		pushup(node);
		  
	}
	void change(int node,int l,int r,int idx,int x){//单点修改 
		if(l==r){
			sum[node]+=x;
			return;
		}
		spread(node,l,r);
		int mid=l+r>>1;
		if(idx<=mid){
			 change(lson,l,mid,idx,x);
		}else{
			 change(rson,mid+1,r,idx,x);
		}
		pushup(node);
	}
	void change(int node,int l,int r,int L,int R,int x){//区间修改 
		if(l==L&&r==R){
			sum[node]+=x*(r-l+1);
			lazy[node]+=x;
			return ;
		}
		spread(node,l,r);
		int mid=l+r>>1;
		if(R<=mid){
			change(lson,l,mid,L,R,x);
		}else if(L>mid){
			change(rson,mid+1,r,L,R,x);
		}else{
		   change(lson,l,mid,L,mid,x);
		   change(rson,mid+1,r,mid+1,R,x);
		}
		pushup(node);
	}
	ll query(int node,int l,int r,int L,int R){
		if(l==L&&r==R){
			return sum[node];
		}
		spread(node,l,r);
		int mid=l+r>>1;
		if(R<=mid)
		  return query(lson,l,mid,L,R);
		else if(L>mid)
		  return query(rson,mid+1,r,L,R);
		else{
			ll ans=0;
			ans+=query(lson,l,mid,L,mid);
			ans+=query(rson,mid+1,r,mid+1,R);
			return ans;
		}
		
	}
	ll query(int node,int l,int r,int idx){//单点查询 
		if(l==r){
		  return	sum[node];
			
		}
		spread(node,l,r);
		int mid=r+l>>1;
		if(idx<=mid){
			return query(lson,l,mid,idx);
		}else{
			return query(rson,mid+1,r,idx);
		}
		
	} 
}tree; 
int main(){
	int n,q;
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++)
	   scanf("%d",&a[i]);
	tree.build(1,1,n);
	for(int i=1;i<=q;i++){
		int t,j,x,l,r;
		scanf("%d",&t);
		if(t==2){
			scanf("%d",&x);
			ll ans=tree.query(1,1,n,x);
			printf("%lld\n",ans);
		}
		if(t==1){
			scanf("%d%d%d",&l,&r,&x);
			tree.change(1,1,n,l,r,x);
		}
	}
}

1.题意：

2.题解：

第一次错在数组a应该用ll，用int小了

3.ac代码：

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e6+10;
ll a[N];
struct segmentTree{
	#define lson (node<<1)
	#define rson (node<<1|1)
	ll sum[N<<2],lazy[N<<2];
	void spread(int node,int l,int r){//下放 
		int mid=(r+l)>>1;
		if(lazy[node]!=0){
			sum[lson]+=1ll*lazy[node]*(mid-l+1);
			sum[rson]+=1ll*lazy[node]*(r-(mid+1)+1);
			lazy[lson]+=lazy[node];
			lazy[rson]+=lazy[node];
			lazy[node]=0;
		
		}
		
		
	}
	void pushup(int node){//回溯 
		sum[node]=sum[lson]+sum[rson];
	}
	void build(int node,int l,int r){//创建树 
		lazy[node]=0;
		if(l==r){
			sum[node]=a[l];
			return;
		}
		int mid=l+r>>1;
		build(lson,l,mid);
		build(rson,mid+1,r);
		pushup(node);
		  
	}
	void change(int node,int l,int r,int idx,int x){//单点修改 
		if(l==r){
			sum[node]+=x;
			return;
		}
		spread(node,l,r);
		int mid=l+r>>1;
		if(idx<=mid){
			 change(lson,l,mid,idx,x);
		}else{
			 change(rson,mid+1,r,idx,x);
		}
		pushup(node);
	}
	void change(int node,int l,int r,int L,int R,int x){//区间修改 
		if(l==L&&r==R){
			sum[node]+=1ll*x*(r-l+1);
			lazy[node]+=x;
			return ;
		}
		spread(node,l,r);
		int mid=l+r>>1;
		if(R<=mid){
			change(lson,l,mid,L,R,x);
		}else if(L>mid){
			change(rson,mid+1,r,L,R,x);
		}else{
		   change(lson,l,mid,L,mid,x);
		   change(rson,mid+1,r,mid+1,R,x);
		}
		pushup(node);
	}
	ll query(int node,int l,int r,int L,int R){
		if(l==L&&r==R){
			return sum[node];
		}
		spread(node,l,r);
		int mid=l+r>>1;
		if(R<=mid)
		  return query(lson,l,mid,L,R);
		else if(L>mid)
		  return query(rson,mid+1,r,L,R);
		else{
			ll ans=0;
			ans+=query(lson,l,mid,L,mid);
			ans+=query(rson,mid+1,r,mid+1,R);
			return ans;
		}
		
	}
	ll query(int node,int l,int r,int idx){//单点查询 
		if(l==r){
		  return	sum[node];
			
		}
		spread(node,l,r);
		int mid=r+l>>1;
		if(idx<=mid){
			return query(lson,l,mid,idx);
		}else{
			return query(rson,mid+1,r,idx);
		}
		
	} 
}tree; 
int main(){
	int n,q;
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++)
	   scanf("%lld",&a[i]);
	tree.build(1,1,n);
	for(int i=1;i<=q;i++){
		int t,j,x,l,r;
		scanf("%d",&t);
		if(t==2){
			scanf("%d%d",&l,&r);
			ll ans=tree.query(1,1,n,l,r);
			printf("%lld\n",ans);
		}
		else if(t==1){
			scanf("%d%d%d",&l,&r,&x);
			tree.change(1,1,n,l,r,x);
		}
	}
}