https://blog.csdn.net/zearot/article/details/48299459?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159987392919724836751684%2522%252C%2522scm%2522%253A%252220140713.130102334…%2522%257D&request_id=159987392919724836751684&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2allfirst_rank_v2~rank_v28-1-48299459.pc_first_rank_v2_rank_v28&utm_term=%E7%BA%BF%E6%AE%B5%E6%A0%91&spm=1018.2118.3001.4187
上面是dalao的线段树详细讲解,相信读完的你对线段树便会有很好的理解。
下面附上在下常用的线段树代码:
1.建树程序如下,时间复杂度(n log n)
void build(int ll,int rr,int number){
if(ll>rr)return;
tree[number].l=ll;tree[number].r=rr;
if(ll==rr)return;
int mid=(ll+rr)/2;
build(ll,mid,number*2);
build(mid+1,rr,number*2+1);
}
2.将区间的所有数加上x的代码如下
void in(int number,int ll,int rr,long long s){
if(!tree[number].l)return;
if(ll<=tree[number].l&&tree[number].r<=rr){
tree[number].value+=(tree[number].r-tree[number].l+1)*s;
tree[number].lazy+=s;
return;
}
else
{
if(tree[number].lazy)down(number);
if(ll<=(tree[number].l+tree[number].r)/2){
in(number*2,ll,rr,s);
}
if(rr>(tree[number].l+tree[number].r)/2){
in(number*2+1,ll,rr,s);
}
tree[number].value=tree[number*2].value+tree[number*2+1].value;
}
}
这里我们用到了lazy_tag,俗称懒标记。
这玩意可以给线段树优化很多的时间,在不加lazy时,线段树每次查询修改时间复杂度为O(2n),而优化后就是O(log n)。
懒标记的思想就是能不往你儿子上传的值就先不传,除非你儿子需要这个值了,否则就一直累加。(lazy里只记区间内每个节点应该加上多少的值)
这里用到了down,这是一个实现lazy的过程,代码如下
void down(int number){
int l=tree[number].l,r=tree[number].r;
int mid=(l+r)/2;
tree[number*2].value+=tree[number].lazy*(mid-l+1);
tree[number*2].lazy+=tree[number].lazy;
tree[number*2+1].value+=tree[number].lazy*(r-mid);
tree[number*2+1].lazy+=tree[number].lazy;
tree[number].lazy=0;
}
4.查询
void query(int number,int ll,int rr){
if(!tree[number].l)return;
if(ll<=tree[number].l&&tree[number].r<=rr){
ans+=tree[number].value;
return;
}
else{
if(tree[number].lazy){
down(number);
}
if(ll<=(tree[number].l+tree[number].r)/2){
query(number*2,ll,rr);
}
if(rr>(tree[number].l+tree[number].r)/2){
query(number*2+1,ll,rr);
}
}
}
将上述各个模块整合一下便是最基本的线段树模板,在做题的时候还需要根据实际情况进行修改。
#include<bits/stdc++.h>
using namespace std;
int n,m;
long long sum[100010];
long long ans;
struct node{
int l,r;
long long value,lazy;
}tree[400050]; //需要开四倍n,不然会炸
void down(int number){//lazy下传
int l=tree[number].l,r=tree[number].r;
int mid=(l+r)/2;
tree[number*2].value+=tree[number].lazy*(mid-l+1);
tree[number*2].lazy+=tree[number].lazy;
tree[number*2+1].value+=tree[number].lazy*(r-mid);
tree[number*2+1].lazy+=tree[number].lazy;
tree[number].lazy=0;
}
void build(int ll,int rr,int number){//建树
if(ll>rr)return;
tree[number].l=ll;tree[number].r=rr;
if(ll==rr)return;
int mid=(ll+rr)/2;
build(ll,mid,number*2);
build(mid+1,rr,number*2+1);
}
void in(int number,int ll,int rr,long long s){//修改区间和操作
if(!tree[number].l)return;
if(ll<=tree[number].l&&tree[number].r<=rr){
tree[number].value+=(tree[number].r-tree[number].l+1)*s;
tree[number].lazy+=s;
return;
}
else
{
if(tree[number].lazy)down(number);
if(ll<=(tree[number].l+tree[number].r)/2){//判定边界
in(number*2,ll,rr,s);
}
if(rr>(tree[number].l+tree[number].r)/2){
in(number*2+1,ll,rr,s);
}
tree[number].value=tree[number*2].value+tree[number*2+1].value;//根据儿子时刻更新
}
}
void query(int number,int ll,int rr){//查询
if(!tree[number].l)return;
if(ll<=tree[number].l&&tree[number].r<=rr){
ans+=tree[number].value;
return;
}
else{
if(tree[number].lazy){
down(number);
}
if(ll<=(tree[number].l+tree[number].r)/2){
query(number*2,ll,rr);
}
if(rr>(tree[number].l+tree[number].r)/2){
query(number*2+1,ll,rr);
}
}
}
int main(){
scanf("%d%d",&n,&m);
build(1,n,1);
for(int i=1;i<=n;i++){
int v;
scanf("%d",&v);
sum[i]=sum[i-1]+v;
}
for(int i=1;i<=m;i++){
int temp,x,y;
scanf("%d%d%d",&temp,&x,&y);
if(temp==1){
long long z;
scanf("%lld",&z);
in(1,x,y,z);
}
else{
ans=0;
query(1,x,y);
ans+=sum[y]-sum[x-1];
printf("%lld\n",ans);
}
}
return 0;
}