单节点更新是指只更新线段树的某个叶子节点的值,但是更新叶子节点会对其父节点的值产生影响,因此更新子节点后,要回溯更新其父节点的值。
同样,还是这个博客,为大佬打电话
[https://www.cnblogs.com/TenosDoIt/p/3453089.html#g]
代码:
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#define MAXN 1000
using namespace std;
int array[MAXN];
struct segtreenode
{
int value;
} segtree[MAXN];
void build(int node,int start,int end)
{
if(start==end)
{
segtree[node].value=array[start];
}
else
{
int mid=(start+end)>>1;
build(2*node,start,mid);
build(2*node+1,mid+1,end);
segtree[node].value=segtree[2*node].value>=segtree[2*node+1].value?segtree[2*node+1].value:segtree[2*node].value;
}
}
int query(int node,int start,int end,int left,int right)
{
if(left>end||right<start)
{
return 1000;
}
if(left<=start&&right>=end)
{
return segtree[node].value;
}
int mid=(start+end)>>1;
int p1=query(2*node,start,mid,left,right);
int p2=query(2*node+1,mid+1,end,left,right);
return p1>=p2?p2:p1;
}
int revalue;
void updateone(int node,int start,int end,int uarray)
{
if(start==end)
{
if(start==uarray)
segtree[node].value+=revalue;
return ;
}
int mid=(start+end)>>1;
if(uarray<=mid)
{
updateone(2*node,start,mid,uarray);
}
else
{
updateone(2*node+1,mid+1,end,uarray);
}
segtree[node].value=segtree[2*node].value>=segtree[2*node+1].value?segtree[2*node+1].value:segtree[2*node].value;
}
int main()
{
int n;
cin>>n;
for(int i=0; i<n; i++)
{
cin>>array[i];
}
build(1,0,n-1);
for(int i=1; i<=2*n+3; i++)
{
cout<<"seg"<<i<<"="<<segtree[i].value<<endl;
}
int left,right;
cin>>left>>right;
cout<<query(1,0,n-1,left,right)<<endl;
int uarray;
cin>>uarray>>revalue;
updateone(1,0,n-1,uarray);
for(int i=1; i<=2*n+3; i++)
{
cout<<"lastseg"<<i<<"="<<segtree[i].value<<endl;
}
}