一道模板题,输入数组in【】一开始设置成longlongWA了一下午!!!!
下面代码注释处应为int,引以为戒!
#include <stdlib.h>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string.h>
#include <math.h>
#include <algorithm>
#define mem(t, v) memset ((t) , v, sizeof(t))
#define INF 0x3f3f3f3f
#define eps 1e-8
typedef long long ll;
using namespace std;
const int MAX=100010;
int t,n,m;
ll in[MAX];//! 此处应为int
char cmd[10];
struct node{
int l,r;
ll sum,id;
}tree[MAX<<2];
void push_down(int i){
ll k=tree[i].id;
if(k!=0){
tree[i<<1].id+=k;
tree[i<<1|1].id+=k;
tree[i<<1].sum+=(tree[i<<1].r-tree[i<<1].l+1)*k;
tree[i<<1|1].sum+=(tree[i<<1|1].r-tree[i<<1|1].l+1)*k;
tree[i].id=0;
}
}
void Build(int i,int l,int r){
tree[i].l=l,tree[i].r=r,tree[i].id=0;
if(l==r){
tree[i].sum=in[l];
return ;
}
int mid=(l+r)>>1;
Build(i<<1,l,mid);
Build(i<<1|1,mid+1,r);
tree[i].sum=tree[i<<1].sum+tree[i<<1|1].sum;
}
void Update(int i,int l,int r,int k){
if(tree[i].l>=l&&tree[i].r<=r){
tree[i].id+=k;
tree[i].sum+=k*(tree[i].r-tree[i].l+1);
return ;
}
if(tree[i].l>r||tree[i].r<l)return;
push_down(i);
if(tree[i<<1].r>=l)Update(i<<1,l,r,k);
if(tree[i<<1|1].l<=r)Update(i<<1|1,l,r,k);
tree[i].sum=tree[i<<1].sum+tree[i<<1|1].sum;
}
ll Search(int i,int l,int r){
if(tree[i].l>=l&&tree[i].r<=r){
// printf("%d %lld %d*%d %d\n",i,tree[i].sum,k,tree[i].l,tree[i].r);
return tree[i].sum;
}
if(tree[i].l>r||tree[i].r<l)return 0;
push_down(i);
ll s=0;
if(tree[i<<1].r>=l)s+=Search(i<<1,l,r);
if(tree[i<<1|1].l<=r)s+=Search(i<<1|1,l,r);
return s;
}
int main(){
while(scanf("%d%d",&n,&m)!=EOF){
for(int i=1;i<=n;i++){
scanf("%d",&in[i]);
}
Build(1,1,n);
// for(int i=0;i<=2*n;i++)
// printf("%d %d %d %d++\n",i,tree[i].l,tree[i].r,tree[i].sum);
while(m--){
int a,b;
char cmd[10];
scanf("%s%d%d",cmd,&a,&b);
if(cmd[0]=='Q'){
ll ans=Search(1,a,b);
printf("%lld\n",ans);
}
else if(cmd[0]=='C'){
ll c;
scanf("%d",&c);
Update(1,a,b,c);
}
}
}
return 0;
}