A Simple Problem with Integers
Time Limit: 5000MS | Memory Limit: 131072K | |
Total Submissions: 165538 | Accepted: 51001 | |
Case Time Limit: 2000MS |
Description
You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.
Input
The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A1, A2, ... , AN. -1000000000 ≤ Ai ≤ 1000000000.
Each of the next Q lines represents an operation.
"C a b c" means adding c to each of Aa, Aa+1, ... , Ab. -10000 ≤ c ≤ 10000.
"Q a b" means querying the sum of Aa, Aa+1, ... , Ab.
Output
You need to answer all Q commands in order. One answer in a line.
Sample Input
10 5
1 2 3 4 5 6 7 8 9 10
Q 4 4
Q 1 10
Q 2 4
C 3 6 3
Q 2 4
Sample Output
4
55
9
15
Hint
The sums may exceed the range of 32-bit integers.
好简单的一道线段树板子题,而我弄了半年没弄出来,太卑微了 ,感谢两位巨佬指点 Orz;
哎还是自己太垃圾,只想着背板子了。。。板子并不是个好东西,还是需要好好去理解啊!!!
难点在于让区间的每一个数 a[i] 都加上一个数 z ,居然忘了pushdown也要加上,不然不会深入啊,就是你自己测试的那个结果,总和改过了,单个的却没改过,这不还是拉JB倒吗!!!
主要代码有两段:
第一段是深入传递部分:
void pd(int k){//pushdown
if(pp[k].lazy==0)
return ;//叶节点没有子节点 不用下传
pp[k<<1].sum+=(pp[k<<1].r-pp[k<<1].l+1)*pp[k].lazy;//向下传递的时候请记得+++lazy!!!
pp[k<<1|1].sum+=(pp[k<<1|1].r-pp[k<<1|1].l+1)*pp[k].lazy; //向下传递的时候请记得+++lazy!!!
pp[k<<1].lazy+=pp[k].lazy;//向下传递的时候请记得+++lazy!!!
pp[k<<1|1].lazy+=pp[k].lazy;//向下传递的时候请记得+++lazy!!!
//重要的事情说四遍!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
pp[k].lazy=0;//清空点k的标记
}
第二段就是add部分了:
void add(int k,int l,int r,int z){
if(pp[k].l>=l&&pp[k].r<=r){
pp[k].sum+=(pp[k].r-pp[k].l+1)*z;//加上先
pp[k].lazy+=z;//再加上
return ;
}
pd(k);
int mid=(pp[k].l+pp[k].r)>>1;
if(r>mid)add(k<<1|1,l,r,z);
if(l<=mid)add(k<<1,l,r,z);
up(k);
}
还有就是要关注好题目要求,再怎么说也要看完题好吧!人家都给你说 数据范围会很大的了 我还铁憨憨一般的坚持int
丢人啊 卑微 Orz
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int mm=1e5+5;
#define ll long long
int a[mm];
struct node{
int l,r;
ll sum;//请看完题再做好吧!!!!!!!
ll lazy;
}pp[mm*4];
void up(int k){
pp[k].sum=pp[k<<1].sum+pp[k<<1|1].sum;
}
void build(int k,int l,int r){
pp[k].l=l;
pp[k].r=r;
if(l==r){
pp[k].sum=a[l];
return ;
}
int mid=(l+r)>>1;
build(k<<1,l,mid);
build(k<<1|1,mid+1,r);
up(k);
}
void pd(int k){//pushdown
if(pp[k].lazy==0)
return ;//叶节点没有子节点 不用下传
pp[k<<1].sum+=(pp[k<<1].r-pp[k<<1].l+1)*pp[k].lazy;//向下传递的时候请记得+++lazy!!!
pp[k<<1|1].sum+=(pp[k<<1|1].r-pp[k<<1|1].l+1)*pp[k].lazy; //向下传递的时候请记得+++lazy!!!
pp[k<<1].lazy+=pp[k].lazy;//向下传递的时候请记得+++lazy!!!
pp[k<<1|1].lazy+=pp[k].lazy;//向下传递的时候请记得+++lazy!!!
//重要的事情说四遍!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
pp[k].lazy=0;//清空点k的标记
}
ll query(int k,int l,int r){//查询区间 l 到 r 的和
if(pp[k].l>=l&&pp[k].r<=r)
return pp[k].sum;
pd(k);
int mid=(pp[k].l+pp[k].r)>>1;
ll sum=0;
if(r>mid)sum+=query(k<<1|1,l,r);//右面的一半
if(l<=mid)sum+=query(k<<1,l,r);//左面的一半
return sum;
}
void add(int k,int l,int r,int z){
if(pp[k].l>=l&&pp[k].r<=r){
pp[k].sum+=(pp[k].r-pp[k].l+1)*z;//加上先
pp[k].lazy+=z;//再加上
return ;
}
pd(k);
int mid=(pp[k].l+pp[k].r)>>1;
if(r>mid)add(k<<1|1,l,r,z);
if(l<=mid)add(k<<1,l,r,z);
up(k);
}
int n,m;
char op[2];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
build(1,1,n);
int x,y,z;
while(m--){
scanf("%s",op);
if(op[0]=='Q'){
scanf("%d%d",&x,&y);
printf("%lld\n",query(1,x,y));
}
if(op[0]=='C'){
scanf("%d%d%d",&x,&y,&z);
//printf("%lld\n",query(1,x,y));
add(1,x,y,z);
}
}
return 0;
}