感觉没什么好说的 就是简单地成段更新,还有区间询问!!!
附AC代码
#include<stdio.h>
#include<string.h>
#include<iostream>
#include <algorithm>
using namespace std;
long long tree[111111*4],lazy[111111*4];
void fun(int i,int x)
{
if(lazy[i]!=0)
{
lazy[i*2]+=lazy[i];
lazy[i*2+1]+=lazy[i];
tree[i*2]+=lazy[i]*(x-(x>>1));
tree[i*2+1]+=lazy[i]*(x>>1);
lazy[i]=0;
}
}
void bulid(int l,int r,int k,long long x,int index)
{
lazy[index]=0;
if(l==k&&r==k)
{
tree[index]=x;
return ;
}
int mid=(l+r)/2;
if(k<=mid) bulid(l,mid,k,x,index*2);
else bulid(mid+1,r,k,x,index*2+1);
tree[index]=tree[index*2]+tree[index*2+1];
}
void insert(int l,int r,int L,int R,int index,int x)
{
int mid=(R+L)/2;
if(l<=L&&r>=R)
{
lazy[index]+=x;
tree[index]=tree[index]+(long long) ((R-L+1)*x);
return ;
}
fun(index,R-L+1);
if(l<=mid) insert(l,r,L,mid,index*2,x);
if(r>mid) insert(l,r,mid+1,R,index*2+1,x);
tree[index]=tree[index*2]+tree[index*2+1];
}
long long query(int L,int R,int l,int r,int index)
{
//printf("%d %d %d %d\n",L,R,l,r);
if(l<=L&&r>=R)
{
return tree[index];
}
fun(index,R-L+1);
int mid=(L+R)/2;
long long a=0;
if(l<=mid) a+=query(L,mid,l,r,index*2);
if(r>mid) a+=query(mid+1,R,l,r,index*2+1);
return a;
}
int main()
{
int i,n,m,x,j;
long long ww;
char c[10];
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%lld",&ww);
bulid(1,n,i,ww,1);
}
while(m--)
{
scanf("%s",c);
if(c[0]=='Q')
{
scanf("%d%d",&i,&j);
printf("%lld\n",query(1,n,i,j,1));
}
else
{
scanf("%d%d%d",&i,&j,&x);
insert(i,j,1,n,1,x);
}
}
return 0;
}