Aragorn's Story HDU - 3966 树链剖分模板

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<cstring>
#include<set>
#include<iterator>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<cmath>
#include<sstream>
#include<cstdio>
#include<stdio.h>
#include<string.h>
using namespace std;
typedef long long ll;
const int N = 5E4 + 5;
int head[N], edge[2 * N], Next[2 * N], tot;
int top[N];
int deep[N];
int num[N];
int p[N];
int fp[N];
int fa[N];
int son[N];
int pos = 1;
void init()
{
	pos = 1;
	tot = 0;
	memset(head, 0, sizeof(head));
	memset(son, -1, sizeof(son));
}
void add(int a, int b)
{
	edge[++tot] = b, Next[tot] = head[a], head[a] = tot;
	edge[++tot] = a, Next[tot] = head[b], head[b] = tot;
}
void dfs1(int u, int pre, int d)
{
	deep[u] = d;
	fa[u] = pre;
	num[u] = 1;
	for (int i = head[u]; i; i = Next[i])
	{
		int v = edge[i];
		if (v != pre)
		{
			dfs1(v, u, d + 1);
			num[u] += num[v];
			if (son[u] == -1 || num[v] > num[son[u]])
			{
				son[u] = v;
			}
		}
	}
}
void getpos(int u, int sp)
{
	top[u] = sp;
	p[u] = pos++;
	fp[p[u]] = u;
	if (son[u] == -1)
		return;
	getpos(son[u], sp);
	for (int i = head[u]; i; i = Next[i])
	{
		int v = edge[i];
		if (v != son[u] && v != fa[u])
		{
			
			getpos(v, v);
		}
	}
}
int lowbit(int x)
{
	return x & (-x);
}
int c[N];
int n;
int sum(int i)
{
	int s = 0;
	while (i > 0)
	{
		s += c[i];
		i -= lowbit(i);
	}
	return s;
}
void update(int i, int val)
{
	while(i <= n)
	{
		c[i] += val;
		i += lowbit(i);
	}
}
void Change(int u, int v, int val)
{
	int f1 = top[u], f2 = top[v];
	int tmp = 0;
	while (f1 != f2)
	{
		if (deep[f1] < deep[f2])
		{
			swap(f1, f2);
			swap(u, v);
		}
		update(p[f1], val);
		update(p[u] + 1, -val);
		u = fa[f1];
		f1 = top[u];
	}
	if (deep[u] > deep[v])
		swap(u, v);
	update(p[u], val);
	update(p[v] + 1, -val);
}
int a[N];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int m, P;
	while (cin >> n >> m >> P)
	{
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i];
		}
		init();
		memset(c, 0, sizeof(c));
		for (int i = 1; i <= m; i++)
		{
			int x, y;
			cin >> x >> y;
			add(x, y);
		}
		dfs1(1, 0, 0);
		getpos(1, 1);
		for (int i = 1; i <= n; i++)
		{
			update(p[i], a[i]);
			update(p[i] + 1, -a[i]);
		}
		while (P--)
		{
			char op;
			cin >> op;
			if (op == 'Q')
			{
				int x;
				cin >> x;
				cout << sum(p[x]) << endl;
			}
			else
			{
				int x, y, k;
				cin >> x >> y >> k;
				if (op == 'D')
				{
					k = -k;
				}
				Change(x, y, k);
			}
		}
}
	return 0;
}