题目链接:
http://poj.org/problem?id=3468
题意:
题解:
区间更新 lazy操作,会爆int , 另外用scanf
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 1e5+10;
ll a[maxn];
struct node{
int l,r;
ll sum,lazy;
void update(ll val){
sum += 1LL * (r-l+1)*val;
lazy += val;
}
}tree[maxn<<2];
void pushup(int rt){
tree[rt].sum = tree[rt<<1].sum + tree[rt<<1|1].sum;
}
void pushdown(int rt){
int lazyval = tree[rt].lazy;
if(lazyval){
tree[rt<<1].update(lazyval);
tree[rt<<1|1].update(lazyval);
tree[rt].lazy = 0;
}
}
void build(int rt, int l, int r){
tree[rt].l = l, tree[rt].r = r;
tree[rt].sum = 0, tree[rt].lazy = 0;
if(l == r){
tree[rt].sum = a[l];
}else{
int mid = (l+r)/2;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
pushup(rt);
}
}
void update(int rt,int l,int r,ll val){
int L = tree[rt].l, R = tree[rt].r;
if(l<=L && R<=r){
tree[rt].update(val);
}else{
pushdown(rt);
int mid = (L+R)/2;
if(l <= mid) update(rt<<1,l,r,val);
if(r > mid) update(rt<<1|1,l,r,val);
pushup(rt);
}
}
ll query(int rt,int l,int r){
int L = tree[rt].l, R = tree[rt].r;
if(l<=L && R<=r){
return tree[rt].sum;
}else{
ll ans = 0;
pushdown(rt);
int mid = (L+R)/2;
if(l<=mid) ans += query(rt<<1,l,r);
if(r>mid) ans += query(rt<<1|1,l,r);
pushup(rt);
return ans;
}
}
int main(){
int n = read(), q = read();
for(int i=1; i<=n; i++)
a[i] = read();
build(1,1,n);
while(q--){
char op; int l,r,va;
scanf(" %c",&op);
if(op == 'Q'){
l=read(),r=read();
printf("%I64d\n",query(1,l,r));
}else{
l=read(),r=read(),va=read();
update(1,l,r,va);
}
}
return 0;
}