线段树的区间修改
开始时套模板, 没做出来,runtime error, 找了许久错误,发现是数据类型应该用long long 。。。。~_~| |。。
#include<iostream>
#include<cstdio>
using namespace std;
const int maxm = 100005;
struct Tree{
int l; int r; long long sum ;
long long add;
}tree[maxm<<2];
int n;
long long sumn;
long long A[maxm];
void pushup(int id){
tree[id].sum = tree[id << 1].sum + tree[id << 1 | 1].sum;
}
void build(int id, int l, int r){
tree[id].l = l;
tree[id].r = r;
tree[id].add = 0;
if(tree[id].l == tree[id].r){
tree[id].sum = A[l];
return ;
}
int mid = (l + r) >>1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
pushup(id);
}
void pushdown(int id){
if(tree[id].add){
long long tmp = tree[id].add;
tree[id<<1].add += tmp; tree[id<<1|1].add += tmp;
tree[id<<1].sum += (tree[id<<1].r-tree[id<<1].l+1)*tmp;
tree[id<<1|1].sum += (tree[id<<1|1].r - tree[id<<1|1].l+1)*tmp;
tree[id].add = 0;
}
}
void update(int id, int l, int r, long long val){
if(tree[id].l >= l&& tree[id].r <= r){
tree[id].sum += (tree[id].l - tree[id].r + 1)*val;
tree[id].add += val;
return ;
}
pushdown(id);
int mid = (tree[id].l + tree[id].r) >> 1;
if(l <= mid)
update(id<<1,l,r,val);
if(mid < r)
update((id<<1)+1,l,r,val);
pushup(id);
}
void query(int id, int l, int r){
if(tree[id].l >= l && tree[id].r <= r){
sumn += tree[id].sum;
return ;
}
pushdown(id);
int mid = ( tree[id].l + tree[id].r) >> 1;
if(l <= mid){
query(id<<1, l, r);
}
if(r > mid){
query(id<<1|1, l, r);
}
pushup(id);
}
int main(){
char str[2];
int q, a, b;
long long c;
while(scanf("%d%d", &n, &q) != EOF){
for(int i = 1; i <= n; i++){
scanf("%lld",&A[i]);
}
build(1,1,n);
while(q--){
scanf("%s", str);
if(str[0] == 'Q') {
scanf("%d%d", &a, &b);
sumn = 0;
query(1,a,b);
printf("%lld\n", sumn);
}else if(str[0] == 'C'){
scanf("%d%d%lld", &a, &b, &c);
update(1,a,b,c);
}
}
}
return 0;
}
------------------------------------------------------------------------------------------------------------------------------
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
const int N = 100005;
struct node{
int l,r;
ll sum;
ll add;
}tree[N<<2];
ll a[N];
ll ans;
void maintain(int id){
tree[id].sum = tree[id<<1].sum + tree[id<<1|1].sum;
}
void build(int id,int l,int r){//id:index
tree[id].l = l;
tree[id].r = r;
tree[id].add = 0;
if(l == r){
tree[id].sum = a[l];
return;
}
int mid = (l+r)>>1;
build(id<<1,l,mid);
build(id<<1|1,mid+1,r);
maintain(id);
}
void pushdown(int id){
if(tree[id].add){
ll tmp = tree[id].add;
tree[id<<1].add += tmp;tree[id<<1|1].add += tmp;
tree[id<<1].sum += (tree[id<<1].r-tree[id<<1].l+1)*tmp;
tree[id<<1|1].sum += (tree[id<<1|1].r - tree[id<<1|1].l+1)*tmp;
tree[id].add = 0;
}
}
void update(int id,int l,int r,ll val){
if(tree[id].l >= l && tree[id].r <= r){
tree[id].add += val;
tree[id].sum += (tree[id].r-tree[id].l+1)*val;
return;
}
pushdown(id);
int mid = (tree[id].l+tree[id].r)>>1;
if(l <= mid)
update(id<<1,l,r,val);
if(mid < r)
update((id<<1)+1,l,r,val);
maintain(id);
}
void query(int id,int l,int r){
if(tree[id].l >= l && tree[id].r <= r){
ans += tree[id].sum;
return;
}
pushdown(id);
int mid = (tree[id].l+tree[id].r)>>1;
if(l <= mid)
query(id<<1,l,r);
if(mid < r)
query(id<<1|1,l,r);
maintain(id);
}
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)){
for(int i = 1; i <= n; i++)
scanf("%lld",&a[i]);
build(1,1,n);
char op[10];
int a,b;
ll c;
while(m--){
scanf("%s",op);
if(op[0] == 'Q'){
scanf("%d%d",&a,&b);
ans = 0;
query(1,a,b);
printf("%lld\n",ans);
}
else if(op[0] == 'C'){
scanf("%d%d%lld",&a,&b,&c);
update(1,a,b,c);
}
}
}
return 0;
}