poj3468- A Simple Problem with Integers-解题报告-线段树

题目链接：http://poj.org/problem?id=3468

这道题也是不能更新到叶节点~~会超时滴，可以成段更新，询问时再向下更新，这样可以省去一些更新不被查询的节点的时间

实现方法是在结构体中增加一个mark 用来记录这一个范围的增量

------------------------------------------------------------------------------------------------------------------------------------------------------------------------

#include<stdio.h>
#define N 100010
#define i64 __int64

struct node{
	int l,r;
	int mark;
	i64 sum;
};
node tree[4*N];
int n,q;
int num[N];
i64 ans;
int h;
void Build(int id,int l,int r)
{
	tree[id].l=l;
	tree[id].r=r;
	if(l==r)
	{
		tree[id].sum=num[l];
		return ;
	}
	Build(id*2,l,(l+r)/2);
	Build(id*2+1,(l+r)/2+1,r);
	tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
}
void Query(int id,int s,int e)
{
	if(tree[id].l==s && tree[id].r==e)
	{	
		ans+=(tree[id].sum+tree[id].mark*(i64)(e-s+1));
		return ;
	}
	if(tree[id].mark!=0)
	{
		tree[id*2].mark+=tree[id].mark;
		tree[id*2+1].mark+=tree[id].mark;
		tree[id].sum+=(i64)(tree[id].r-tree[id].l+1)*tree[id].mark;
		tree[id].mark=0;
	}
	if(e<=(tree[id].l+tree[id].r)/2)
		Query(id*2,s,e);
	else if(s>=(tree[id].l+tree[id].r)/2+1)
		Query(id*2+1,s,e);
	else
	{
		Query(id*2,s,(tree[id].l+tree[id].r)/2);
		Query(id*2+1,(tree[id].l+tree[id].r)/2+1,e);
	}
}

void CAdd(int id,int s,int e)
{
	
	if(tree[id].l==s && tree[id].r==e)
	{
		tree[id].mark+=h;
		return ;
	}
	tree[id].sum+=(e-s+1)*h;
	if(e<=(tree[id].l+tree[id].r)/2)
		CAdd(id*2,s,e);
	else if(s>=(tree[id].l+tree[id].r)/2+1)
		CAdd(id*2+1,s,e);
	else
	{
		CAdd(id*2,s,(tree[id].l+tree[id].r)/2);
		CAdd(id*2+1,(tree[id].l+tree[id].r)/2+1,e);
	}
}
int main()
{
	int i,a,b,c;
	char s[5];
	scanf("%d%d",&n,&q);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&num[i]);
	}
	Build(1,1,n);
	for(i=1;i<=q;i++)
	{
		scanf("%s",s);
		if(s[0]=='Q')
		{
			ans=0;
			scanf("%d%d",&a,&b);
			Query(1,a,b);
			printf("%I64d\n",ans);
		}
		else if(s[0]=='C')
		{
			scanf("%d%d%d",&a,&b,&h);
			CAdd(1,a,b);
		}
	}
	return 0;
}