Tree--树链剖分

题目链接：http://poj.org/problem?id=3237

题目大意

QUERY a b：询问节点a到节点b路径上边权的最大值。

CHANGE a b：把第a条边的权值改为b。

NEGATE a b：把节点a到节点b路径上的边权取反。

分析

树链剖分加线段树维护最大值和最小值。为什么要维护最小值呢？假设某个区间的最大值是6，最小值是-2，当取反的时候，最大值并不是自身取反，而是最小值取反，所以要同时维护最大值和最小值。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1e4+5;
int n, cnt, tot;
int fa[N], dep[N], size[N], son[N], top[N], id[N], value[N], num[N], head[2*N];
struct Edge{
	int to, nxt;
}edge[2*N];
struct node{
	int l, r, big, lazy, small;
}tr[N<<2];
struct Path{	//记录每条边的信息 
	int x, y, val;
	void read()
	{
		scanf("%d %d %d", &x, &y, &val);
	}
}path[N];
void add(int a, int b)
{
	edge[cnt].to = b;
	edge[cnt].nxt = head[a];
	head[a] = cnt++;
}
void dfs1(int d, int f, int u)//d:深度，f:父节点，u:当前节点 
{
	size[u] = 1;
	dep[u] = d;
	fa[u] = f;
	son[u] = 0;
	for(int i = head[u]; i != -1; i = edge[i].nxt)
	{
		int j = edge[i].to;
		if(j == f) continue;
		dfs1(d + 1, u, j);
		size[u] += size[j];	//size记录子树节点总数 
		if(size[son[u]] < size[j])//找出重儿子 
			son[u] = j;
	}
}
void dfs2(int u, int tp)//u:当前节点，tp:链的顶端节点 
{
	top[u] = tp;
	id[u] = ++tot;
	num[tot] = u;
	if(son[u]) dfs2(son[u], tp);//重儿子优先 
	for(int i = head[u]; i != -1; i = edge[i].nxt)
	{
		int j = edge[i].to;
		if(j == fa[u] || j == son[u]) continue;
		dfs2(j, j);
	}
}
void pushup(int m)
{
	tr[m].big = max(tr[m<<1].big, tr[m<<1|1].big);
	tr[m].small = min(tr[m<<1].small, tr[m<<1|1].small);
}
void pushdown(int m)
{
	if(tr[m].lazy)
	{
		tr[m<<1].big = -tr[m<<1].big;
		tr[m<<1].small = -tr[m<<1].small;
		swap(tr[m<<1].big, tr[m<<1].small);
		tr[m<<1|1].big = -tr[m<<1|1].big;
		tr[m<<1|1].small = -tr[m<<1|1].small;
		swap(tr[m<<1|1].big, tr[m<<1|1].small);
		tr[m<<1].lazy ^= 1;
		tr[m<<1|1].lazy ^= 1;
		tr[m].lazy = 0;
	}
}
void build(int m, int l, int r)
{
	tr[m].l = l;
	tr[m].r = r;
	tr[m].lazy = 0;
	if(l == r)
	{
		tr[m].big = value[num[l]];
		tr[m].small = value[num[l]];
		return ;
	}
	int mid = (l + r) >> 1;
	build(m<<1, l, mid);
	build(m<<1|1, mid + 1, r);
	pushup(m);
}
void change(int m, int id, int val)
{
	if(tr[m].l == id && tr[m].r == id)
	{
		tr[m].big = val;
		tr[m].small = val;
		tr[m].lazy = 0;
		return ;
	}
	pushdown(m);
	int mid = (tr[m].l + tr[m].r) >> 1;
	if(id <= mid) change(m<<1, id, val);
	else change(m<<1|1, id, val);
	pushup(m);
}
void updata(int m, int l, int r)
{
	if(tr[m].l >= l && tr[m].r <= r)
	{
		tr[m].big = -tr[m].big;
		tr[m].small = -tr[m].small;
		swap(tr[m].big, tr[m].small);
		tr[m].lazy ^= 1;
		return ;
	}
	pushdown(m);
	int mid = (tr[m].l + tr[m].r) >> 1;
	if(l <= mid) updata(m<<1, l, r);
	if(r > mid) updata(m<<1|1, l, r);
	pushup(m);
}
int ask(int m, int l, int r)
{
	if(tr[m].l >= l && tr[m].r <= r) return tr[m].big;
	pushdown(m);
	int res = -1e9;
	int mid = (tr[m].l + tr[m].r) >> 1;
	if(l <= mid) res = max(res, ask(m<<1, l, r));
	if(r > mid) res = max(res, ask(m<<1|1, l, r));
	return res;
}
int find(int s, int e)
{
	int fs = top[s];
	int fe = top[e];
	int tmp = -1e9;
	while(fs != fe)
	{
		if(dep[fs] < dep[fe])
		{
			swap(fs, fe);
			swap(s, e);
		}
		tmp = max(tmp, ask(1, id[fs], id[s]));
		s = fa[fs];
		fs = top[s];
	}
	if(s == e) return tmp;
	if(dep[s] > dep[e]) swap(s, e);
	return max(tmp, ask(1, id[son[s]], id[e]));
}
void Negate(int s, int e)
{
	int fs = top[s];
	int fe = top[e];
	while(fs != fe)
	{
		if(dep[fs] < dep[fe])
		{
			swap(fs, fe);
			swap(s, e);
		}
		updata(1, id[fs], id[s]);
		s = fa[fs];
		fs = top[s];
	}
	if(s == e) return ;
	if(dep[s] > dep[e]) swap(s, e);
	updata(1, id[son[s]], id[e]);
}
int main()
{
	int t;
	scanf("%d", &t);
	while(t--)
	{
		cnt = tot = 0;
		memset(head, -1, sizeof head);
		memset(size, 0, sizeof size);
		scanf("%d", &n);
		for(int i = 1; i < n; i++)
		{
			path[i].read();
			add(path[i].x, path[i].y);
			add(path[i].y, path[i].x);
		}
		dfs1(1, 0, 1);
		dfs2(1, 1);
		value[1] = 0;
		for(int i = 1; i < n; i++)//将每条边的权值赋给深度大的端点 
		{
			if(dep[path[i].x] < dep[path[i].y])
				swap(path[i].x, path[i].y);
			value[path[i].x] = path[i].val;
		}
		build(1, 1, n);
		char s[15];
		while(~scanf("%s", s))
		{
			if(s[0] == 'D') break;
			int u, a, b, val;
			if(s[0] == 'C')
			{
				scanf("%d %d", &u, &val);
				change(1, id[path[u].x], val);
			}
			else if(s[0] == 'N')
			{
				scanf("%d %d", &a, &b);
				Negate(a, b);
			}
			else
			{
				scanf("%d %d", &a, &b);
				printf("%d\n", find(a, b));
			}
		}
	 } 
	return 0;
}