kuangbin带你飞 -----线段树总结一

最新推荐文章于 2020-12-25 23:09:14 发布

weixin_44019404

最新推荐文章于 2020-12-25 23:09:14 发布

阅读量107

点赞数

分类专栏：线段树

本文链接：https://blog.csdn.net/weixin_44019404/article/details/100990831

版权

线段树专栏收录该内容

28 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<string>
//#include<regex>
#include<cstdio>
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read()
{
	char ch = getchar(); int x = 0, f = 1;
	while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * f;
}
typedef pair<int, int> pir;
const int N = 5e5 + 10;
int num[4 * N];
int lazy[4 * N];
int T;
int n;
void pushup(int root)
{
	num[root] = num[root << 1] + num[root << 1 | 1];
}
void build(int l, int r, int root)
{
	if (l == r) {
		num[root] = 0; return;
	}
	int mid = (l + r) >> 1;
	build(l, mid, root << 1);
	build(mid + 1, r, root << 1 | 1);
	pushup(root);
}
void update(int l, int r, int root, int pos, int val)
{
	if (l == r)
	{
		num[root] += val;
		return;
	}
	int mid = (l + r) >> 1;
	if (pos <= mid)update(l, mid, root << 1, pos, val);
	else update(mid + 1, r, root << 1 | 1, pos, val);
	pushup(root);
}
int querry(int l, int r, int root ,int lf, int rt)
{
	if (lf <= l && r <= rt)return num[root];
	int mid = (l + r) >> 1;
	int ans = 0;
	if (lf <= mid)ans+=querry(l, mid, root << 1, lf, rt);
	if (rt > mid)ans+=querry(mid + 1, r, root << 1 | 1, lf, rt);	
	return ans;
}
int main()
{
	T = read();
	for (int i = 1; i <= T; i++)
	{
		string s;
		n = read();
		build(1, n, 1);
		int x;
		up(i, 0, n)
		{
			x = read(); update(1, n, 1, i + 1, x);
		}
		printf("Case %d:\n", i);
		while (cin >> s && s != "End")
		{
			if (s == "Query")
			{
				int x, y; x = read(), y = read();
				cout << querry(1, n, 1, x, y) << endl;
			}
			if (s == "Add")
			{
				int p, v;
				p = read(), v = read();
				update(1, n, 1, p, v);
			}
			if (s == "Sub")
			{
				int p, v;
				p = read(), v = read();
				update(1, n, 1, p, -v);
			}
		}
	}
	return 0;
}