线段树各种神操作

接下来就到了大名鼎鼎的线段树了！

线段树是一种维护区间可加信息的数据结构

传说中无所不能，神通广大的它到底有什么本事呢

请看今日说法

技能一 区间最大值  稀有程度 普通

RMQ问题，是各种数据结构的裸题，也不一定非要用线段树做，常数很大，ST表显然是一个很好的选择

但是就是一道练手题

Code

#include<cstdio>
#include<iostream>
using namespace std;
int n,k,t;
int x,y;
struct poi
{
	int l,r,maxx;
}tre[800005];
int a[200005];
void bt(int l,int r,int num)
{
	tre[num].l=l;
	tre[num].r=r;
	if(l==r)
	{
		tre[num].maxx=a[l];
		return ;
	}
	else 
	{
		int mid=(l+r)/2;
		bt(l,mid,num*2);
		bt(mid+1,r,num*2+1);
		tre[num].maxx=max(tre[num*2].maxx,tre[num*2+1].maxx);
	}
}
int ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(tre[num].l>=x&&tre[num].r<=y)return tre[num].maxx;
	int mid=(l+r)/2;
	int maxx1=-2000000000,maxx2=-2000000000;
	if(mid>=x)maxx1=ask(num*2);
	if(mid<y)maxx2=ask(num*2+1);
	return max(maxx1,maxx2);
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x);
		a[i]=x;
	}
	bt(1,n,1);
	cin>>t;
	for(int i=1;i<=t;i++)
	{
		scanf("%d%d",&x,&y);

		printf("%d\n",ask(1));
	}
	return 0;
}

技能2 求逆序对 稀有程度 普通

线段树是可以求逆序对的~~只是常数太大，写起来太复杂，一般没人用，都用树状数组

Code

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n;
struct poi
{
	int num,pl,lsh;
}a[100005];
struct tr
{
	int l,r,sum;
}tre[400005];
int x,y;
void bt(int l,int r,int num)
{
	tre[num].l=l;
	tre[num].r=r;
	tre[num].sum=0;
	if(l==r)return;
	int mid=(l+r)/2; 
	bt(l,mid,num*2);
	bt(mid+1,r,num*2+1);
}
void add(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(l==r)
	{
		tre[num].sum++;
		return ;
	}
	int mid=(l+r)/2;
	if(mid>=x)add(num*2);
	else add(num*2+1);
	tre[num].sum=tre[num*2].sum+tre[num*2+1].sum;
}
int ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(l>=x&&r<=y)
	{
		return tre[num].sum;
	}
	int mid=(l+r)/2;
	if(mid<x)return ask(num*2+1);
	if(mid>=y)return  ask(num*2);
	return ask(num*2)+ask(num*2+1);
}
bool cmp(poi a,poi b)
{
	return a.num<b.num;
} 
bool cmp1(poi a,poi b)
{
	return a.pl<b.pl; 
} 
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i].num);
		a[i].pl=i;
	}
	sort(a+1,a+1+n,cmp);
	a[0].num=a[1].num-1;
	int js=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i].num!=a[i-1].num)js++;
		a[i].lsh=js;
	}
	sort(a+1,a+1+n,cmp1);
	bt(1,js,1);
	long long ans=0;
	for(int i=1;i<=n;i++)
	{
		x=a[i].lsh;
		add(1);
		x=1;
		y=a[i].lsh;
		ans+=i-ask(1);
	//	cout<<ans<<endl;
	}
	printf("%lld",ans);
}

技能3 单点修改 稀有程度 一般 

递归下去即可

Code

void add(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(l==r)
	{
		tre[num].sum=v;
		return ;
	}
	int mid=(l+r)/2;
	if(mid>=x)add(num*2);
	else add(num*2+1);
	update(num);
}

技能4 单点查询 稀有程度 一般

同上

int ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(l==r)
	{
		return tre[num].sum;
	}
	int mid=(l+r)/2;
	if(mid<x)return ask(num*2+1);
	return ask(num*2);
}

技能5 区间查询 稀有程度 较稀有

要注意递归到左右边界都在查询范围之内是要停止递归，这样可以严格控制在log级别

Code

int ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(l>=x&&r<=y)
	{
		return tre[num].sum;
	}
	int mid=(l+r)/2;
	if(mid<x)return ask(num*2+1);
	if(mid>=y)return  ask(num*2);
	return ask(num*2)+ask(num*2+1);
}

技能6 区间修改 稀有程度 稀有

引入了线段树的精华--lazy标记，可以将区间修改控制在log级别

要看修改的方式来初始化lazy标记

Code 单点查询，区间修改

#include<cstdio>
#include<iostream>
using namespace std;
int n,m;
int x,y,v;
struct poi
{
	int lazy;
	int l,r;
	int sum;
	int num;
}tre[4000005];
void bt(int l,int r,int num)
{
	tre[num].l=l;
	tre[num].r=r;
	tre[num].lazy=0;
	tre[num].num=num;
	tre[num].sum=0;
	if(tre[num].l==tre[num].r)
	return ;
	int mid=(l+r)/2;
	bt(l,mid,num*2);
	bt(mid+1,r,num*2+1);
	return ;
}
void add(int num)
{
	
	int l=tre[num].l;
	int r=tre[num].r;
	if(tre[num].l>=x&&tre[num].r<=y)
	{
		tre[num].sum+=v*(r-l+1);
		tre[num].lazy+=v;
		if(tre[num].l==tre[num].r)tre[num].lazy=0;
		return ;
	}
	int mid=(l+r)/2;
	if(tre[num].lazy)
	{
		tre[num*2].lazy+=tre[num].lazy;
		tre[num*2+1].lazy+=tre[num].lazy;
		tre[num*2].sum+=(mid-l+1)*tre[num].lazy;
		tre[num*2+1].sum+=(r-mid)*tre[num].lazy;
		tre[num].lazy=0;
		if(l==mid)tre[num*2].lazy=0;
		if(mid+1==r)tre[num*2+1].lazy=0;
	}
	if(x>mid)add(num*2+1);
	else if(y<mid+1)add(num*2);
	else 
	{
		add(num*2);
		add(num*2+1);
	}
	tre[num].sum=tre[num*2].sum+tre[num*2+1].sum;
	return ;
}
int ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(l==r)
	{
		return tre[num].sum;
	}
	int mid=(l+r)/2;
	if(tre[num].lazy)
	{
		tre[num*2].lazy+=tre[num].lazy;
		tre[num*2+1].lazy+=tre[num].lazy;
		tre[num*2].sum+=(mid-l+1)*tre[num].lazy;
		tre[num*2+1].sum+=(r-mid)*tre[num].lazy;
		tre[num].lazy=0;
		if(l==mid)tre[num*2].lazy=0;
		if(mid+1==r)tre[num*2+1].lazy=0;
	}
	if(mid<x)return ask(num*2+1);
	return ask(num*2);
}
int main()
{
	scanf("%d%d",&n,&m);
	bt(1,n,1);
	int type;
	for(int i=1;i<=m;i++)
	{
		scanf("%d",&type);
		if(type==1)
		{
		scanf("%d%d%d",&x,&y,&v);
		add(1);	
		}
		if(type==2)
		{
		scanf("%d%d%d",&x,&y,&v);
		v=-v;
		add(1);	
		}
		if(type==3)
		{
		scanf("%d",&x);
		printf("%d\n",ask(1));	
		}
	}
	return 0;
}

Code 区间查询，区间修改

区间加或减一个数

#include<cstdio>
#include<iostream>
using namespace std;
int n,m;
int x,y,v;                                                                                                                                                        
int a[60005];
struct poi
{
	int lazy;
	int l,r;
	int sum;
	int num;
	int maxx,minn;
}tre[2500005];
void pushdown(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	int mid=(l+r)/2;
	tre[num*2].lazy+=tre[num].lazy;
	tre[num*2+1].lazy+=tre[num].lazy;
	tre[num*2].sum+=(mid-l+1)*tre[num].lazy;
	tre[num*2+1].sum+=(r-mid)*tre[num].lazy;
	tre[num*2+1].maxx+=tre[num].lazy;
	tre[num*2+1].minn+=tre[num].lazy;
	tre[num*2].maxx+=tre[num].lazy;
	tre[num*2].minn+=tre[num].lazy;
	tre[num].lazy=0;
	if(l==mid)tre[num*2].lazy=0;
	if(mid+1==r)tre[num*2+1].lazy=0;
}
void back(int num)
{
	tre[num].sum=tre[num*2].sum+tre[num*2+1].sum;
	tre[num].minn=min(tre[num*2].minn,tre[num*2+1].minn);
	tre[num].maxx=max(tre[num*2].maxx,tre[num*2+1].maxx);
}
void bt(int l,int r,int num)
{
	tre[num].l=l;
	tre[num].r=r;
	tre[num].lazy=0;
	tre[num].num=num;
	if(tre[num].l==tre[num].r)
	{
		tre[num].sum=a[l];
		tre[num].maxx=a[l];
		tre[num].minn=a[l];
		return ;	
	}
	int mid=(l+r)/2;
	bt(l,mid,num*2);
	bt(mid+1,r,num*2+1);
	back(num);
	return ;
}
void add(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(tre[num].l>=x&&tre[num].r<=y)
	{
		tre[num].sum+=v*(r-l+1);
		tre[num].maxx+=v;
		tre[num].minn+=v;
		tre[num].lazy+=v;
		if(tre[num].l==tre[num].r)tre[num].lazy=0;
		return ;
	}
	int mid=(l+r)/2;
	if(tre[num].lazy)
	{
		pushdown(num);
	}
	if(x>mid)add(num*2+1);
	else if(y<mid+1)add(num*2);
	else 
	{
		add(num*2);
		add(num*2+1);
	}
	back(num);
	return ;
}
poi ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(tre[num].l>=x&&tre[num].r<=y)
	{
		return tre[num];
	}
	int mid=(l+r)/2;
	if(tre[num].lazy)
	{
		pushdown(num);
	}
	if(mid<x)return ask(num*2+1);
	if(y<mid+1)return ask(num*2);
	poi ans1=ask(num*2);
	poi ans2=ask(num*2+1);
	poi ans3;
	ans3.sum=ans1.sum+ans2.sum;
	ans3.maxx=max(ans1.maxx,ans2.maxx);
	ans3.minn=min(ans1.minn,ans2.minn);
	return ans3;
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	scanf("%d",&a[i]);
	bt(1,n,1);
	scanf("%d",&m);
	int type;
	for(int i=1;i<=m;i++)
	{
		scanf("%d",&type);
		if(type==0)
		{
		scanf("%d%d%d",&x,&y,&v);
		add(1);	
		}
		if(type==1)
		{
		scanf("%d%d",&x,&y);
		poi ans=ask(1);
		printf("%d %d %d\n",ans.sum,ans.minn,ans.maxx);	
		}
	}
	return 0;
}

区间变为一个数

#include<cstdio>
#include<iostream>
using namespace std;
int n,m;
int x,y,v;                                                                                                                                                        
int a[50005];
const int inf=1000000003;
struct poi
{
	int lazy;
	int l,r;
	int sum;
	int num;
	int maxx,minn;
}tre[2000005];
void pushdown(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	int mid=(l+r)/2;
	tre[num*2].lazy=tre[num].lazy;
	tre[num*2+1].lazy=tre[num].lazy;
	tre[num*2].sum=(mid-l+1)*tre[num].lazy;
	tre[num*2+1].sum=(r-mid)*tre[num].lazy;
	tre[num*2+1].maxx=tre[num].lazy;
	tre[num*2+1].minn=tre[num].lazy;
	tre[num*2].maxx=tre[num].lazy;
	tre[num*2].minn=tre[num].lazy;
	tre[num].lazy=inf;
	if(l==mid)tre[num*2].lazy=inf;
	if(mid+1==r)tre[num*2+1].lazy=inf;
}
void back(int num)
{
	tre[num].sum=tre[num*2].sum+tre[num*2+1].sum;
	tre[num].minn=min(tre[num*2].minn,tre[num*2+1].minn);
	tre[num].maxx=max(tre[num*2].maxx,tre[num*2+1].maxx);
}
void bt(int l,int r,int num)
{
	tre[num].l=l;
	tre[num].r=r;
	tre[num].lazy=inf;
	tre[num].num=num;
	if(tre[num].l==tre[num].r)
	{
		tre[num].sum=a[l];
		tre[num].maxx=a[l];
		tre[num].minn=a[l];
		return ;	
	}
	int mid=(l+r)/2;
	bt(l,mid,num*2);
	bt(mid+1,r,num*2+1);
	back(num);
	return ;
}
void add(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(tre[num].l>=x&&tre[num].r<=y)
	{
		tre[num].sum=v*(r-l+1);
		tre[num].maxx=v;
		tre[num].minn=v;
		tre[num].lazy=v;
		if(tre[num].l==tre[num].r)tre[num].lazy=inf;
		return ;
	}
	int mid=(l+r)/2;
	if(tre[num].lazy!=inf)
	{
		pushdown(num);
	}
	if(x>mid)add(num*2+1);
	else if(y<mid+1)add(num*2);
	else 
	{
		add(num*2);
		add(num*2+1);
	}
	back(num);
	return ;
}
poi ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(tre[num].l>=x&&tre[num].r<=y)
	{
		return tre[num];
	}
	int mid=(l+r)/2;
	if(tre[num].lazy!=inf)
	{
		pushdown(num);
	}
	if(mid<x)return ask(num*2+1);
	if(y<mid+1)return ask(num*2);
	poi ans1=ask(num*2);
	poi ans2=ask(num*2+1);
	poi ans3;
	ans3.sum=ans1.sum+ans2.sum;
	ans3.maxx=max(ans1.maxx,ans2.maxx);
	ans3.minn=min(ans1.minn,ans2.minn);
	return ans3;
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	scanf("%d",&a[i]);
	bt(1,n,1);
	scanf("%d",&m);
	int type;
	for(int i=1;i<=m;i++)
	{
		scanf("%d",&type);
		if(type==0)
		{
		scanf("%d%d%d",&x,&y,&v);
		add(1);	
		}
		if(type==1)
		{
		scanf("%d%d",&x,&y);
		poi ans=ask(1);
		printf("%d %d %d\n",ans.sum,ans.minn,ans.maxx);	
		}
	}
	return 0;
}

技能7 最大连续和 稀有程度 罕见

好吧。。。很多人都不服气。。。但是前面的所有问题都可以用树状数组解决，只是有点麻烦，但是这个我还真没有见过用其他方法解决的（如果dalao们有其他方法，欢迎在下方留言）

对于每一个节点，维护以左端点为起点最大连续和，右端点为中点最大连续和，区间最大连续和，区间和

然后乱搞 其实yy一下就好了

看代码（附赠单点修改）

#include<cstdio>
#include<iostream>
using namespace std;
int n,k,t;
int x,y;
struct poi
{
	int l,r,maxxr,maxxl,sum,maxx;
}tre[800005];
int a[200005];
void pushup(poi &a,poi &b,poi &c)
{
	c.maxxr=max(a.maxxr+b.sum,b.maxxr);
	c.maxxl=max(a.maxxl,a.sum+b.maxxl);
	c.sum=a.sum+b.sum;
	c.maxx=max(max(a.maxx,b.maxx),a.maxxr+b.maxxl);
}
void cg(int num)
{
	if(tre[num].l==tre[num].r)
	{
		tre[num].maxx=tre[num].sum=tre[num].maxxr=tre[num].maxxl=y;
		return ;
	}
	int mid=(tre[num].l+tre[num].r)/2;
	if(mid>=x)cg(num*2);
	else cg(num*2+1);
	pushup(tre[num*2],tre[num*2+1],tre[num]);;
}
void bt(int l,int r,int num)
{
	tre[num].l=l;
	tre[num].r=r;
	if(l==r)
	{
		tre[num].maxx=tre[num].sum=tre[num].maxxr=tre[num].maxxl=a[l];
		return ;
	}
	else 
	{
		int mid=(l+r)/2;
		bt(l,mid,num*2);
		bt(mid+1,r,num*2+1);
		pushup(tre[num*2],tre[num*2+1],tre[num]);
		//cout<<tre[num].sum<<endl;
	}
}
poi ask(int num)
{
	int l=tre[num].l;
	int r=tre[num].r;
	if(tre[num].l>=x&&tre[num].r<=y)
	{
		//cout<<num<<" "<<tre[num].maxx<<endl;
	return tre[num];	
	}
	int mid=(l+r)/2;
	if(mid<x)return ask(num*2+1);
	else if(mid>=y)return ask(num*2);
	else 
	{
		poi a=ask(num*2);
		poi b=ask(num*2+1);
		poi c;
		pushup(a,b,c);
		return c;
	}
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x);
		a[i]=x;
	}
	bt(1,n,1);
	cin>>t;
	int type;
	for(int i=1;i<=t;i++)
	{
		scanf("%d%d%d",&type,&x,&y);
		if(!type)
		{
			cg(1);
		}
		else printf("%d\n",ask(1).maxx);
	}
	return 0;
}

好了，线段树到这里就讲完了，希望大家一起学习，共同进步！