题目大意:
中文题面
就是区间中单点增减, 区间求和
大致思路:
线段树练手题1....还是得系统地学一下线段树才能少一些疑虑
代码如下:
Result : Accepted Memory : 2136 KB Time : 249 ms
/*
* Author: Gatevin
* Created Time: 2015/8/14 21:22:04
* File Name: Sakura_Chiyo.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
#define maxn 50010
struct Segment_Tree
{
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
int val[maxn << 2];
void pushUp(int rt)
{
val[rt] = val[rt << 1] + val[rt << 1 | 1];
return;
}
void build(int l, int r, int rt)
{
if(l == r)
{
scanf("%d", &val[rt]);
return;
}
int mid = (l + r) >> 1;
build(lson);
build(rson);
pushUp(rt);
return;
}
void update(int l, int r, int rt, int pos, int value)
{
if(l == r)
{
val[rt] += value;
return;
}
int mid = (l + r) >> 1;
if(pos <= mid) update(lson, pos, value);
else update(rson, pos, value);
pushUp(rt);
return;
}
int query(int l, int r, int rt, int L, int R)
{
if(l >= L && r <= R)
return val[rt];
int mid = (l + r) >> 1;
int ret = 0;
if(mid >= L) ret += query(lson, L, R);
if(mid + 1 <= R) ret += query(rson, L, R);
return ret;
}
};
Segment_Tree ST;
char seq[100];
int main()
{
int T;
scanf("%d", &T);
for(int cas = 1; cas <= T; cas++)
{
printf("Case %d:\n", cas);
int n;
scanf("%d", &n);
ST.build(1, n, 1);
int l, r;
while(scanf("%s", seq))
{
if(seq[0] == 'E')
break;
switch(seq[0])
{
case 'Q': scanf("%d %d", &l, &r);
printf("%d\n", ST.query(1, n, 1, l, r));
break;
case 'A': scanf("%d %d", &l, &r);
ST.update(1, n, 1, l, r);
break;
case 'S': scanf("%d %d", &l, &r);
ST.update(1, n, 1, l, -r);
break;
}
}
}
return 0;
}