2016夏季练习

来源：POJ3237

树链剖分

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define lson rt<<1
#define rson rt<<1|1
#define ___ debug();
using namespace std;
const int MAXN = 10010;
const int INF = 0x3f3f3f3f;
struct Edge{
	int nxt,to;
}edge[MAXN<<1];
int head[MAXN],tot;
int fa[MAXN],son[MAXN],top[MAXN],dep[MAXN],p[MAXN],fp[MAXN],num[MAXN],pos;

void ini(){
	memset(son,-1,sizeof(son));
	memset(head,-1,sizeof(head));
	tot = pos = 0;
}
int e[MAXN][3];
void addedge(int u,int v){
	edge[tot].to = v;
	edge[tot].nxt = head[u];
	head[u] = tot++;
}
void dfs(int rt,int pre,int d){
	fa[rt] = pre;
	dep[rt] = d;
	num[rt] = 1;
	for(int i=head[rt];i!=-1;i=edge[i].nxt){
		int now = edge[i].to;
		if(now == pre) continue;
		dfs(now,rt,d+1);
		num[rt] += num[now];
		if(son[rt] == -1 || num[now]>num[son[rt]]) {
			son[rt] = now;
		}
	}
}
void getpos(int rt,int sp){
	p[rt] = ++pos;
	fp[p[rt]] = rt;
	top[rt] = sp;
	if(son[rt]!=-1) getpos(son[rt],sp);
	for(int i=head[rt];i!=-1;i=edge[i].nxt){
		int now = edge[i].to;
		if(now == fa[rt] || now == son[rt]) continue;
		getpos(now,now);
	}
}
struct Segment{
	int l,r;
	int minx,maxn;
	int lazy;
}tree[MAXN<<2];
void debug(){
	cout<<endl;
	for(int i=1;i<=pos*4;i++){
		cout<<i<<" "<<tree[i].l<<" "<<tree[i].r<<" "<<tree[i].minx<<" "<<tree[i].maxn<<endl;
	}
	cout<<endl;
}
void pushup(int rt){
    tree[rt].maxn = max(tree[lson].maxn,tree[rson].maxn);
    tree[rt].minx = min(tree[lson].minx,tree[rson].minx);
}
void pushdown(int rt){
	if(tree[rt].lazy<0){
		tree[lson].lazy *= -1;
		tree[rson].lazy *= -1;
		swap(tree[lson].minx,tree[lson].maxn);
		tree[lson].minx *= -1;
		tree[lson].maxn *= -1;
		swap(tree[rson].minx,tree[rson].maxn);
		tree[rson].minx *= -1;
		tree[rson].maxn *= -1;
		tree[rt].lazy = 1;
	}
}
void build(int rt,int l,int r){
	tree[rt].l = l;
	tree[rt].r = r;
	tree[rt].minx = INF;
	tree[rt].maxn = -INF;
	tree[rt].lazy = 1;
	if(l == r) return ;
	int mid = (l+r)>>1;
	build(lson,l,mid);
	build(rson,mid+1,r);
	pushup(rt);
}
void add(int rt,int pos,int data){
    if(tree[rt].l == pos && pos == tree[rt].r) {
		tree[rt].minx = tree[rt].maxn = data;
		return ;
    }
    int mid = (tree[rt].l + tree[rt].r) >>1;
    if(pos<=mid) add(lson,pos,data);
    else add(rson,pos,data);
    pushup(rt);
}

void updatedata(int rt,int pos,int data){
	if(tree[rt].l == pos && tree[rt].r == pos){
		tree[rt].minx = tree[rt].maxn = data;
		return ;
	}
	pushdown(rt);
	int mid = (tree[rt].l + tree[rt].r)>>1;
	if(pos<=mid) updatedata(lson,pos,data);
	else updatedata(rson,pos,data);
	pushup(rt);
}
void updateflag(int rt,int left,int right){
	if(left<=tree[rt].l && tree[rt].r<=right){
		tree[rt].lazy *= -1;
		swap(tree[rt].minx,tree[rt].maxn);
		tree[rt].minx *= -1;
		tree[rt].maxn *= -1;
		return;
	}
	pushdown(rt);
	int mid = (tree[rt].l + tree[rt].r)>>1;
	if(left<=mid) updateflag(lson,left,right);
	if(right>mid) updateflag(rson,left,right);
	pushup(rt);
}
int query(int rt,int left,int right){
    if(left<=tree[rt].l && tree[rt].r<=right){
		return tree[rt].maxn;
    }
    pushdown(rt);
    int mid = (tree[rt].l+tree[rt].r)>>1;
    if(right<=mid) return query(lson,left,right);
    else if(left>mid) return query(rson,left,right);
	else{
		return max(query(lson,left,right),query(rson,left,right));
	}
}
void change(int u,int v){
	int f1 = top[u];
	int f2 = top[v];
	while(f1!=f2){
		if(dep[f1]<dep[f2]){
			swap(f1,f2);
			swap(u,v);
		}
		updateflag(1,p[f1],p[u]);
		u = fa[f1];
		f1 = top[u];
	}
	if(u==v) return ;
	if(dep[u]>dep[v])swap(u,v);
	updateflag(1,p[son[u]],p[v]);
}
int lookfor(int u,int v){
	int f1 = top[u];
	int f2 = top[v];
	int tmp = -INF;
	while(f1!=f2){
		if(dep[f1]<dep[f2]){
			swap(f1,f2);
			swap(u,v);
		}
		tmp = max(tmp,query(1,p[f1],p[u]));
		u = fa[f1];
		f1 = top[u];
	}
	if(u==v) return tmp;
	if(dep[u]>dep[v])swap(u,v);
	return max(tmp,query(1,p[son[u]],p[v]));
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		int n;
		ini();
		scanf("%d",&n);
		for(int i=1;i<n;i++){
			scanf("%d%d%d",&e[i][0],&e[i][1],&e[i][2]);
			addedge(e[i][0],e[i][1]);
			addedge(e[i][1],e[i][0]);
		}
        dfs(1,0,0);
        getpos(1,1);
        build(1,1,pos);
        for(int i=1;i<n;i++){
			if(dep[e[i][0]]>dep[e[i][1]]) add(1,p[e[i][0]],e[i][2]);
			else add(1,p[e[i][1]],e[i][2]);
        }
		char op[10];
		int u,v,pos,data;
		while(scanf("%s",op)!=EOF){
			if(op[0] == 'D') break;
            if(op[0] == 'Q'){
				scanf("%d%d",&u,&v);
				printf("%d\n",lookfor(u,v));
            }
            if(op[0] == 'C'){
				scanf("%d%d",&pos,&data);
				if(dep[e[pos][0]]>dep[e[pos][1]]) updatedata(1,p[e[pos][0]],data);
				else updatedata(1,p[e[pos][1]],data);
            }
            if(op[0] == 'N'){
				scanf("%d%d",&u,&v);
				change(u,v);
            }
		}
	}
	return 0;
}
/*
2

3
1 2 1
2 3 2
QUERY 1 2
CHANGE 1 3
QUERY 1 2
Nagate 1 3
QUERY 1 2
QUERY 1 3
CHANGE 2 -22
NAGATE 1 3
QUERY 1 3
DONE

6
2 5 2
4 2 2
1 2 1
3 1 2
2 6 3
Q 4 3
N 4 3
Q 4 3
N 5 2
C 2 10
Q 5 3
N 5 6
Q 6 1
N 1 3
Q 2 1
Q 4 6
Q 5 3
D


*/