题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1166
题目思路:单点更新,区间查询,线段树模板题,套板子就ok
代码:
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define FOU(i,x,y) for(int i=x;i<=y;i++)
#define FOD(i,x,y) for(int i=x;i>=y;i--)
#define MEM(a,val) memset(a,val,sizeof(a))
#define PI acos(-1.0)
const double EXP = 1e-9;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const ll MINF = 0x3f3f3f3f3f3f3f3f;
const double DINF = 0xffffffffffff;
const int mod = 1e9+7;
const int N = 1e6+5;
int a[N],n; //输入数据,构造线段树数组
struct node{
int lft,rht;
int sum; //区间和
int maxx; //区间最大值
int minn; //区间最小值
int lazy; //延迟标记,减小时间复杂度
}segTree[N*4]; //需要开4倍
void pushUp(int id){ //区间合并,上放
segTree[id].sum = segTree[id*2].sum+segTree[id*2+1].sum;
}
void pushDown(int id){
if(segTree[id].lazy){ //区间修改过,需要下放
//在原来的值上加上val
segTree[id*2].sum += (segTree[id*2].rht-segTree[id*2].lft+1)*segTree[id].lazy;
segTree[id*2+1].sum += (segTree[id*2+1].rht-segTree[id*2+1].lft+1)*segTree[id].lazy;
segTree[id*2].lazy += segTree[id].lazy;
segTree[id*2+1].lazy += segTree[id].lazy;
segTree[id].lazy = 0;
}
}
void build(int id,int l,int r){
segTree[id].lft = l, segTree[id].rht = r;
segTree[id].lazy = 0, segTree[id].sum = 0; //开始一定要清0
if(l == r){ //到达叶子节点,不继续建树
segTree[id].sum = a[l];
}
else{ //否则继续建树
int mid = (l+r)>>1;
build(id*2,l,mid);
build(id*2+1,mid+1,r);
pushUp(id);
}
}
void upDate(int id,int l,int r,int val){ //更新l~r区间,加val,或减val(就传-val),或改成val
if(l<=segTree[id].lft&&r>=segTree[id].rht){
segTree[id].sum += (segTree[id].rht-segTree[id].lft+1)*val;
segTree[id].lazy += val; //延迟标记
}
else{
pushDown(id); //区间下放
int mid = (segTree[id].lft+segTree[id].rht)>>1;
if(r <= mid)
upDate(id*2,l,r,val);
else if(l>=mid+1)
upDate(id*2+1,l,r,val);
else{
upDate(id*2,l,r,val);
upDate(id*2+1,l,r,val);
}
pushUp(id);
}
}
int query(int id,int l,int r){ //查询l~r的值
if(l<=segTree[id].lft&&r>=segTree[id].rht){ //该区间包含在查询区间内,可直接返回
return segTree[id].sum;
}
pushDown(id); //区间下放
int mid = (segTree[id].lft+segTree[id].rht)>>1;
int ans = 0;
if(r<=mid){ //只用管左子树
ans += query(id*2,l,r);
}
else if(l>=mid+1){ //只用管右子树
ans+=query(id*2+1,l,r);
}
else{
ans += query(id*2,l,r)+query(id*2+1,l,r);
}
return ans;
}
int main()
{
std::ios::sync_with_stdio(false);
int t,x,y;
char op[10];
scanf("%d",&t);
int cnt=0;
while(t--){
cnt++;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
build(1,1,n);
printf("Case %d:\n",cnt);
while(~scanf(" %s",&op)){
if(op[0]=='E')
break;
else if(op[0]=='A'){
scanf("%d%d",&x,&y);
upDate(1,x,x,y);
}
else if(op[0]=='S'){
scanf("%d%d",&x,&y);
upDate(1,x,x,-y);
}
else
{
scanf("%d%d",&x,&y);
printf("%d\n",query(1,x,y));
}
}
}
return 0;
}