2021-02-02

数据结构

ST表

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
const int N=1e5+10;
int t,n,q,l,r;
int a[N],d[N][20],f[20];
int main(){
	f[0]=1;
	for(int i=1;i<=15;i++) f[i]=2*f[i-1];
	scanf("%d",&t);
	while(t--){
		memset(d,0,sizeof(d));
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			d[i][0]=a[i];
		}
		for(int j=1;(1<<j)<=n;j++){
			for(int i=1;i+(1<<j)-1<=n;i++){
				d[i][j]=max(d[i][j-1],d[i+(1<<(j-1))][j-1]);
			}
		}
		scanf("%d",&q);
		while(q--){
			scanf("%d%d",&l,&r);
			int k=(int)(log(1.0*(r-l+1))/log(2.0));
			printf("%d\n",max(d[l][k],d[r-f[k]+1][k]));
		}
	}
	return 0;
}

树状数组

 

通过这样就可以用树状数组实现区间修改区间查询，树状数组常数小于线段树且代码简洁，因此推荐用树状数组。

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
const int N=1e5+10;
ll a[N],n,q;
ll sum[N],b[N],c[N];
int lowbit(int x){
	return x&-x;
}
void add(int x,ll v1,ll v2){
	for(;x<=n;x+=lowbit(x)){
		b[x]+=v1;c[x]+=v2;
	}
}
ll query1(int x){
	ll res=0;
	for(;x>0;x-=lowbit(x)){
		res+=b[x];
	}
	return res;
}
ll query2(int x){
	ll res=0;
	for(;x>0;x-=lowbit(x)){
		res+=c[x];
	}
	return res;
}
int main(){
	scanf("%lld%lld",&n,&q);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	for(int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
	for(int i=1;i<=q;i++){
		char ch;ll l,r,k;
		while(ch=getchar()){
			if(ch=='Q'||ch=='C') break;
		}
		if(ch=='C'){
			scanf("%lld%lld%lld",&l,&r,&k);
			add(l,k,k*l);add(r+1,-k,-k*(r+1));
		}else{
			scanf("%lld%lld",&l,&r);
			ll ans1=query1(l-1)*l-query2(l-1);
			ll ans2=query1(r)*(r+1)-query2(r);
			printf("%lld\n",sum[r]-sum[l-1]+ans2-ans1);
		}
	}
	return 0;
} 

线段树

1、单点修改，区间查询最值

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
const int N=2e5+10;
ll n,m,a[N];
struct tree{
	ll maxn;
}tr[N<<2];
void build(int pos,int l,int r){
	if(l==r){
		tr[pos].maxn=a[l];
		return ;
	}
	int mid=l+r>>1;
	build(pos*2,l,mid);
	build(pos*2+1,mid+1,r);
	tr[pos].maxn=max(tr[pos*2].maxn,tr[pos*2+1].maxn);
}
void update(int pos,int l,int r,int x,ll v){
	if(l==r){
		if(l==x)
		tr[pos].maxn=v;
		return ;
	}
	int mid=l+r>>1;
	if(x<=mid) update(pos*2,l,mid,x,v);
	else update(pos*2+1,mid+1,r,x,v);
	tr[pos].maxn=max(tr[pos*2].maxn,tr[pos*2+1].maxn);
}
ll query(int pos,int l,int r,int L,int R){
	if(l>=L&&r<=R) return tr[pos].maxn;
	int mid=l+r>>1;ll ans=0;
	if(L<=mid) ans=query(pos*2,l,mid,L,R);
	if(R>mid) ans=max(ans,query(pos*2+1,mid+1,r,L,R));
	return ans;
}
int main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	build(1,1,n);
	while(m--){
		char s[5];int l,r;
		scanf("%s",s+1);
		scanf("%d%d",&l,&r);
		if(s[1]=='Q'){
			//cout<<tr[1].maxn<<endl;
			printf("%lld\n",query(1,1,n,l,r));
		}else{
			update(1,1,n,l,r);
		}
	}
	return 0;
}