【动态树】 SPOJ Query on a tree

动态树入门题。。。。给出一颗树，树的边上有权值，两种操作，1修改一条边上的权值，2查询两个节点x和y之间的最短路径中经过的最大的边的权值。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 400005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

struct node *null;
struct node
{
	int Max, key;
	node *ch[2], *fa;
	
	inline void pushup()
	{
		if(this == null) return;
		Max = max(key, max(ch[0]->Max, ch[1]->Max));
	}

	inline void setc(node *p, int d)
	{
		ch[d] = p;
		p->fa = this;
	}

	inline bool d()
	{
		return fa->ch[1] == this;
	}

	inline bool isroot()
	{
		return fa == null || fa->ch[0] != this && fa->ch[1] != this;
	}
	
	void rot()
	{
		node *f = fa, *ff = fa->fa;
		int c = d(), cc = fa->d();
		f->setc(ch[!c], c);
		this->setc(f, !c);
		if(ff->ch[cc] == f) ff->setc(this, cc);
		else this->fa = ff;
		f->pushup();
	}

	node* splay()
	{
		while(!isroot()) {
			if(!fa->isroot()) d() == fa->d() ? fa->rot() : rot();
			rot();
		}
		pushup();
		return this;
	}

	node* access()
	{
		for(node *p = this, *q = null; p != null; q = p, p = p->fa) {
			p->splay()->setc(q, 1);
			p->pushup();
		}
		return splay();
	}
};

node pool[maxm], *tail;
node *Node[maxn];
node *update[maxn];
struct Edge
{
	int v, w, id;
	Edge *next;
}E[maxm], *H[maxn], *edges;
int vis[maxn];
queue<int> q;
char s[100];
int n, m;

void addedges(int u, int v, int w, int id)
{
	edges->v = v;
	edges->w = w;
	edges->id = id;
	edges->next = H[u];
	H[u] = edges++;
}

void init()
{
	tail = pool;
	null = tail++;
	null->ch[0] = null->ch[1] = null->fa = null;
	null->key = null->Max = -INF;
	edges = E;
	memset(H, 0, sizeof H);
	memset(vis, 0, sizeof vis);
}

void read()
{
	int u, v, w;
	scanf("%d", &n);
	for(int i = 1; i < n; i++) {
		scanf("%d%d%d", &u, &v, &w);
		addedges(u, v, w, i);
		addedges(v, u, w, i);
	}
	for(int i = 1; i <= n; i++) {
		tail->key = tail->Max = -INF;
		tail->ch[0] = tail->ch[1] = tail->fa = null;
		Node[i] = tail++;
	}
}

void bfs()
{
	vis[1] = 1;
	q.push(1);
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		for(Edge *e = H[u]; e; e = e->next) {
			int v = e->v, w = e->w, id = e->id;
			if(vis[v]) continue;
			vis[v] = 1;
			q.push(v);
			Node[v]->fa = Node[u];
			Node[v]->key = w;
			update[id] = Node[v];
		}
	}
}

int ask(node* x, node* y)
{
	x->access();
	for(x = null; y != null; x = y, y = y->fa) {
		y->splay();
		if(y->fa == null) return max(y->ch[1]->Max, x->Max);
		y->setc(x, 1);
		y->pushup();
	}
}

void work()
{
	int x, y;
	bfs();
	while(scanf("%s", s) != EOF) {
		if(strcmp(s, "DONE") == 0) break;
		scanf("%d%d", &x, &y);
		if(s[0] == 'Q') printf("%d\n", ask(Node[x], Node[y]));
		else update[x]->splay()->key = y, update[x]->pushup();
	}
}

int main(void)
{
	int _;
	scanf("%d", &_);
	while(_--) {
		init();
		read();
		work();
	}

	return 0;
}