http://acm.hdu.edu.cn/showproblem.php?pid=1166
常规线段树操作
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<stack>
#include<sstream>
#include<fstream>
using namespace std;
const int maxn = 500000;
int tree[maxn], arr[maxn];
void build(int node, int start, int end) {
if (start == end) {
tree[node] = arr[start];
return;
}
int mid = (start + end) / 2;
build(2 * node + 1, start, mid);
build(2 * node + 2, mid + 1, end);
tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
}
void update(int node, int start, int end, int idx, int val) {
if (start == end && start == idx) {
arr[idx] += val;//Note
tree[node] += val;//Note
return;
}
int mid = (start + end) / 2;
int left_node = 2 * node + 1;
int right_node = 2 * node + 2;
if (idx >= start && idx <= mid)
update(left_node, start, mid, idx, val);
else
update(right_node, mid + 1, end, idx, val);
tree[node] = tree[left_node] + tree[right_node];
}
// 区间和查找,lr为查找范围,LR为线段树范围
int query_range(int node, int l, int r, int L, int R) {
if (l <= L && r >= R)
return tree[node];
int mid = (L + R) / 2;
int sum = 0;
//当线段树范围[L,mid]和查找范围[l,r]有交集时
if (mid >= l)
sum += query_range(node * 2 + 1, l, r, L, mid);
if (mid < r)
sum += query_range(node * 2 + 2, l, r, mid + 1, R);
return sum;
}
int main()
{
int t;
cin >> t;
int cnt = 0;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin>>arr[i];
build(0, 0, n - 1);
printf("Case %d:\n", ++cnt);
string s;
while (cin >> s) {
if (s == "Query")
{
int i, j;
scanf("%d%d", &i, &j);
i--; j--;
printf("%d\n",query_range(0, i, j, 0, n - 1));
}
if (s == "Add")
{
int i, j;
scanf("%d%d", &i, &j);
update(0, 0, n - 1, --i, j);
}
if (s == "Sub")
{
int i, j;
scanf("%d%d", &i, &j);
update(0, 0, n - 1, --i, -j);
}
if (s == "End")
break;
}
}
return 0;
}