http://codevs.cn/problem/1082/
分析:
这里是线段树实现的
这个是树状数组实现的 http://blog.csdn.net/mm__1997/article/details/76691744
AC代码:
#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include<list>
#include <bitset>
#include <climits>
#include <algorithm>
#define gcd(a,b) __gcd(a,b)
typedef long long LL;
const LL mod=1e9+7;
const int INF=0x3f3f3f3f;
const int MAX=1e6+5;
const double PI=acos(-1.0);
using namespace std;
LL a[MAX];
struct Tree{
int l,r;
LL val;
LL add; // 标记
}T[MAX];
void build(int rt,int l,int r){// 建树
T[rt].add=0;
T[rt].l=l;
T[rt].r=r;
if (l==r) {
T[rt].val=a[l];
return ;
}
int mid=(l+r)/2;
build(rt*2,l,mid);
build(rt*2+1,mid+1,r);
T[rt].val=T[rt*2].val+T[rt*2+1].val;
}
void pushDown(int rt,int l,int r){// 标记下推
if (T[rt].add!=0){
T[rt*2].add+=T[rt].add;
T[rt*2+1].add+=T[rt].add;
T[rt*2].val+=T[rt].add*l;
T[rt*2+1].val+=T[rt].add*r;
T[rt].add=0;
}
}
void update(int rt,int l,int r,int e){// 修改区间
if (T[rt].l>=l&&T[rt].r<=r){
T[rt].add+=e;
T[rt].val+=e*(T[rt].r-T[rt].l+1);
return ;
}
int mid=(T[rt].l+T[rt].r)/2;
pushDown(rt,mid-T[rt].l+1,T[rt].r-mid);
if (l<=mid) update(rt*2,l,r,e);
if (r>mid) update(rt*2+1,l,r,e);
T[rt].val=T[rt*2].val+T[rt*2+1].val;
}
LL Query (int rt,int Ql,int Qr){// 查询
if (T[rt].l>=Ql&&T[rt].r<=Qr) return T[rt].val;
int mid=(T[rt].l+T[rt].r)/2;
pushDown(rt,mid-T[rt].l+1,T[rt].r-mid);
LL ans=0;
if (Ql<=mid) ans+=Query(rt*2,Ql,Qr);
if (Qr>mid) ans+=Query(rt*2+1,Ql,Qr);
return ans;
}
int main (){
int n;
while(scanf("%d",&n)!=EOF){
for (int i=1;i<=n;i++) scanf ("%lld",&a[i]);
build(1,1,n);
int m;
scanf ("%d",&m);
for (int i=0;i<m;i++){
int x;
scanf ("%d",&x);
if (x==1){
int s,e,v;
scanf ("%d%d%d",&s,&e,&v);
update(1,s,e,v);
}
else {
int s,e;
scanf ("%d%d",&s,&e);
printf ("%lld\n",Query(1,s,e));
}
}
}
return 0;
}