poj 2828是最简单的线段树,单点更新的;
我的理解,线段是就是用一维数组存放了一个二叉树; 一维数组tree[1] 对应着根,根的左右俩个结点,编号为 i*2, i*2+1 ,存放在 tree[i*2] ,tree[i*2+1] 中;
首先建树: build_tree () 用递归的思想,把每个节点存放的东西计算好;
把当前节点分成 [st,mid] , [mid+1,ed] 的俩个左右孩子节点;
树的最后一层是单个的值: [1,1] , [2,2]……[n,n];
第二步,更新,注意对当前节点标记mark 的维护,使用完后要清零,避免重复增加; 标记还要对推给子节点;
第三步,统计;技巧:在更改参数时,x,y代表实际要找的区间,st,ed代表当前查找的区间,那么,只用更新 st,ed即可,当 x<=st && y>=ed 说明当前区间属于要找的实际区间; 当 x>ed || y<st 说明不包含; 剩余情况为不全包含,那继续二分区间进行查找;
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<map>
#include<set>
using namespace std;
const int maxn=100100;
typedef long long LL;
int a[maxn];
struct node{
LL sum,mark;
}tree[maxn*5];
int n,m;
void update(int st,int ed,int i){
if(!tree[i].mark) return ;
int mid=(st+ed)/2;
tree[i*2].sum+=tree[i].mark*(mid-st+1);
tree[i*2].mark+=tree[i].mark;
tree[i*2+1].sum+=tree[i].mark*(ed-mid);
tree[i*2+1].mark+=tree[i].mark;
tree[i].mark=0;
}
LL require(int x,int y,int st,int ed,int i){
if(x>ed || y<st) return 0;
if(x<=st && y>=ed) return tree[i].sum;
update(st,ed,i);
int mid=(st+ed)/2;
return require(x,y,st,mid,i*2)+require(x,y,mid+1,ed,i*2+1);
}
void add_value(int x,int y,int st,int ed,int i,int val){
if(x>ed||y<st) return ;
if(x<=st&&y>=ed){
tree[i].mark+=val;
tree[i].sum+=val*(ed-st+1);
return;
}
update(st,ed,i);
int mid=(st+ed)/2;
add_value(x,y,st,mid,i*2,val);
add_value(x,y,mid+1,ed,i*2+1,val);
tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
void build_tree(int st,int ed,int i){
tree[i].mark=0;
if(st==ed){
tree[i].sum=a[st];
return;
}
int mid=(st+ed)/2;
build_tree(st,mid,i*2);
build_tree(mid+1,ed,i*2+1);
tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
char s;
int x,y,val;
LL ans;
int main()
{
// freopen("in.in","r",stdin);
while(~scanf("%d%d",&n,&m)){
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
build_tree(1,n,1);
while(m--){
scanf("%s",&s);
if(s=='Q'){
scanf("%d%d",&x,&y);
ans=require(x,y,1,n,1);
cout<<ans<<endl;
}
else {
scanf("%d%d%d",&x,&y,&val);
add_value(x,y,1,n,1,val);
}
}
}
return 0;
}