A Simple Problem with Integers----HDU_3468----线段树之成段更新
2012-09-28 10:07
369 查看
地址:http://poj.org/problem?id=3468
/* Author:Bob Lee 2012.9.27 =================================================== 题意: 在一个区间内 每次有两种操作 某个区间内加上某个数 某个区间内的和 =================================================== 思路: 赤裸裸的线段树 区间更新 每次要往下传 也要往上推 很基础,不多赘述了 */ #include<iostream> #include<cstdio> using namespace std; #define maxn 100005 #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 long long add[maxn<<2]; long long sum[maxn<<2]; void PushDown(int rt,int m) { if(add[rt]) { add[rt<<1] += add[rt]; add[rt<<1|1] += add[rt]; sum[rt<<1] += add[rt]*(m-(m>>1)); sum[rt<<1|1] += add[rt]*(m>>1); add[rt] = 0; } } void PushUp(int rt) { sum[rt] = sum[rt<<1] + sum[rt<<1|1]; } void build(int l,int r,int rt) { add[rt] = 0; if(l==r) { scanf("%lld",&sum[rt]); return; } int m = (l+r)>>1; build(lson); build(rson); PushUp(rt); } void update(int L,int R,int c,int l,int r,int rt) { if(L<=l && r<=R) { add[rt]+=c; sum[rt]+=(long long)c*(r-l+1); return; } PushDown(rt,r-l+1); int m=(l+r)>>1; if(L<=m) update(L,R,c,lson); if(R>m) update(L,R,c,rson); PushUp(rt); } long long query(int L,int R,int l,int r,int rt) { if(L<=l && r<=R) { return sum[rt]; } PushDown(rt,r-l+1); int m = (l+r)>>1; long long ret= 0; if(L<=m) ret+= query(L,R,lson); if(R>m) ret+= query(L,R,rson); return ret; } int main() { int N,Q; scanf("%d%d",&N,&Q); build(1,N,1); while(Q--) { char op[2]; int a,b,c; scanf("%s",op); if(op[0] == 'Q') { scanf("%d%d",&a,&b); printf("%lld\n",query(a,b,1,N,1)); } else { scanf("%d%d%d",&a,&b,&c); update(a,b,c,1,N,1); } } return 0; }
相关文章推荐
- poj 3468 A Simple Problem with Integers (线段树 成段更新 加值 求和)
- POJ 3468 A Simple Problem with Integers (线段树,成段更新,区间求和)
- POJ 3468 A Simple Problem with Integers 线段树成段更新
- poj 3468 A Simple Problem with Integers(线段树|成段更新,区间查询)
- POJ 3468 A Simple Problem with Integers 线段树 成段更新
- [ACM] poj 3468 A Simple Problem with Integers(线段树,成段更新,懒惰标记)
- poj 3468 A Simple Problem with Integers 线段树成段更新模板
- poj 3468 A Simple Problem with Integers 【线段树-成段更新】
- POJ 3468 A Simple Problem with Integers (线段树成段更新) 解题报告
- POJ 3468 A Simple Problem with Integers 线段树 (成段更新)
- POJ - 3468 A Simple Problem with Integers(线段树成段更新,查询区间和)
- [ACM] poj 3468 A Simple Problem with Integers(线段树,成段更新,懒惰标记)
- POJ 3468 A Simple Problem with Integers(线段树成段更新)
- poj-3468 A Simple Problem with Integers(线段树成段更新)
- poj 3468 A Simple Problem with Integers(线段树成段更新,延迟标记,Lazy)
- POJ 3468:A Simple Problem with Integers(线段树[成段更新])
- poj 3468 A Simple Problem with Integers(线段树成段更新,懒惰标记的使用)经典题目
- [ACM] poj 3468 A Simple Problem with Integers(线段树,成段更新,懒惰标记)
- POJ 3468 A Simple Problem with Integers(线段树成段更新)
- POJ 3468 A Simple Problem with Integers(线段树 成段更新)