poj3237 Tree

题面在这里

题目大意：

有一棵树，要求支持树上单点修改，链取反（相反数），询问链上最大边权。

做法：

额....树剖裸题。维护一个线段树，打tag表示取不取反，然后线段树里要维护最大的和最小的值mx[o]和mi[o]，更新的时候就是：swap(mx[o], mi[o]); mx[o] = -mx[o]; mi[o] = -mi[o]。

然后先欣赏一下我的艰辛历程emmmmm。。。。

qwq...

代码如下：

/*************************************************************
	Problem: bzoj3237 Tree
	User: fengyuan
	Language: C++
	Result: Accepted
	Time: 610 ms
	Memory: 2.6 MB
	Submit_Time: 2017-12-04 23:01:10
*************************************************************/

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cctype>
#include<vector>
#include<map>
#include<queue>
#include<string>
#define rep(i, x, y) for (int i = (x); i <= (y); i ++)
#define down(i, x, y) for (int i = (x); i >= (y); i --)
#define mid ((l+r)/2)
#define lc (o<<1)
#define rc (o<<1|1)
#define pb push_back
#define mp make_pair
#define PII pair<int, int>
#define F first
#define S second
#define B begin()
#define E end()
using namespace std;
typedef long long LL;
//head

const int N = 20010;
int n, cnt, clk;
char s[10];
int x[N], y[N], z[N], head[N], p[N], fa[N], son[N], sz[N], depth[N], top[N], val[N], mi[N<<2], mx[N<<2], tag[N<<2];
struct Edge{
	int to, nex, v;
}e[N<<1];

inline void add(int x, int y, int z)
{
	e[++ cnt].to = y;
	e[cnt].v = z;
	e[cnt].nex = head[x];
	head[x] = cnt;
}

inline void dfs(int u, int last, int s)
{
	fa[u] = last; depth[u] = s; sz[u] = 1;
	for (int i = head[u]; i; i = e[i].nex){
		int v = e[i].to; if (v == last) continue;
		dfs(v, u, s+1); sz[u] += sz[v];
		if (!son[u] || sz[v] > sz[son[u]]) son[u] = v;
	}
}

inline void dfs2(int u, int t)
{
	p[u] = ++ clk; top[u] = t;
	if (!son[u]) return;
	dfs2(son[u], t);
	for (int i = head[u]; i; i = e[i].nex){
		int v = e[i].to; if (v == son[u] || v == fa[u]) continue;
		dfs2(v, v);
	}
}

inline void pushup(int o)
{
	mx[o] = max(mx[lc], mx[rc]);
	mi[o] = min(mi[lc], mi[rc]);
}

inline void build(int o, int l, int r)
{
	if (l == r){
		mx[o] = mi[o] = val[l]; tag[o] = 0;
		return;
	}
	build(lc, l, mid); build(rc, mid+1, r);
	pushup(o);
}

inline void pushdown(int o)
{
	if (tag[o] == 0) return;
	swap(mx[lc], mi[lc]); mx[lc] = -mx[lc]; mi[lc] = -mi[lc];
	swap(mx[rc], mi[rc]); mx[rc] = -mx[rc]; mi[rc] = -mi[rc];
	tag[lc] ^= 1; tag[rc] ^= 1;
	tag[o] = 0;
}

inline void point(int o, int l, int r, int x, int v)
{
	pushdown(o);
	if (l == x && r == x){
		mx[o] = v; mi[o] = v;
		tag[o] = 0;
		return;
	}
	if (x <= mid) point(lc, l, mid, x, v);
	else point(rc, mid+1, r, x, v);
	pushup(o);
}

inline void update(int o, int l, int r, int x, int y)
{
	pushdown(o);
	if (l == x && r == y){
		swap(mx[o], mi[o]);
		mx[o] = -mx[o]; mi[o] = -mi[o];
		tag[o] ^= 1;
		return;
	}
	if (y <= mid) update(lc, l, mid, x, y);
	else if (x > mid) update(rc, mid+1, r, x, y);
	else update(lc, l, mid, x, mid), update(rc, mid+1, r, mid+1, y);
	pushup(o);
}

inline void solve(int x, int y)
{
	while (top[x] != top[y]){
		if (depth[top[x]] < depth[top[y]]) swap(x, y);
		update(1, 1, n, p[top[x]], p[x]);
		x = fa[top[x]];
	}
	if (x == y) return;
	if (depth[x] > depth[y]) swap(x, y);
	update(1, 1, n, p[son[x]], p[y]);
}

inline int query(int o, int l, int r, int x, int y)
{
	pushdown(o);
	if (l == x && r == y) return mx[o];
	if (y <= mid) return query(lc, l, mid, x, y);
	else if (x > mid) return query(rc, mid+1, r, x, y);
	else return max(query(lc, l, mid, x, mid), query(rc, mid+1, r, mid+1, y));
}

inline int getMx(int x, int y)
{
	int ret = -1e9;
	while (top[x] != top[y]){
		if (depth[top[x]] < depth[top[y]]) swap(x, y);
		ret = max(ret, query(1, 1, n, p[top[x]], p[x]));
		x = fa[top[x]];
	}
	if (x == y) return ret;
	if (depth[x] > depth[y]) swap(x, y);
	return max(ret, query(1, 1, n, p[son[x]], p[y]));
}

int main()
{
	int Test; scanf("%d", &Test);
	while (Test --){
		scanf("%d", &n);
		cnt = 0; memset(head, 0, sizeof head);
		memset(son, 0, sizeof son);
		memset(top, 0, sizeof top);
		memset(sz, 0, sizeof sz);
		memset(fa, 0, sizeof fa);
		memset(depth, 0, sizeof depth);
		rep(i, 1, n-1){
			scanf("%d%d%d", &x[i], &y[i], &z[i]);
			add(x[i], y[i], z[i]); add(y[i], x[i], z[i]);
		}
		clk = 0;
		memset(tag, 0, sizeof tag);
		dfs(1, 0, 0); dfs2(1, 1);
		rep(i, 1, n-1){
			if (depth[x[i]] < depth[y[i]]) swap(x[i], y[i]);
			val[p[x[i]]] = z[i];
		}
		build(1, 1, n);
		while (~scanf("%s", s) && s[0] != 'D'){
			int u, v; scanf("%d%d", &u, &v);
			if (s[0] == 'C') point(1, 1, n, p[x[u]], v);
			else if (s[0] == 'N') solve(u, v);
			else printf("%d\n", getMx(u, v));
		}
	}
	return 0;
}