SPOJ QTREE Query on a Tree【树链剖分模板题】

树链剖分，线段树维护~

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
 
const int MAXN = ;
struct Edge
{
    int to,next;
}edge[MAXN*];
int head[MAXN],tot;
int top[MAXN];//top[v]表示v所在的重链的顶端节点
int fa[MAXN]; //父亲节点
int deep[MAXN];//深度
int num[MAXN];//num[v]表示以v为根的子树的节点数
int p[MAXN];//p[v]表示v与其父亲节点的连边在线段树中的位置
int fp[MAXN];//和p数组相反
int son[MAXN];//重儿子
int pos;
void init()
{
    tot = ;
    memset(head,-,sizeof(head));
    pos = ;
    memset(son,-,sizeof(son));
}
void addedge(int u,int v)
{
    edge[tot].to = v;edge[tot].next = head[u];head[u] = tot++;
}
void dfs1(int u,int pre,int d) //第一遍dfs求出fa,deep,num,son
{
    deep[u] = d;
    fa[u] = pre;
    num[u] = ;
    for(int i = head[u];i != -; i = edge[i].next)
    {
        int v = edge[i].to;
        if(v != pre)
        {
            dfs1(v,u,d+);
            num[u] += num[v];
            if(son[u] == - || num[v] > num[son[u]])
                son[u] = v;
        }
    }
}
void getpos(int u,int sp) //第二遍dfs求出top和p
{
    top[u] = sp;
    if(son[u] != -)
    {
        p[u] = pos++;
        fp[p[u]] = u;
        getpos(son[u],sp);
    }
    else
    {
        p[u] = pos++;
        fp[p[u]] = u;
        return;
    }
    for(int i = head[u] ; i != -; i = edge[i].next)
    {
        int v = edge[i].to;
        if(v != son[u] && v != fa[u])
            getpos(v,v);
    }
}
 
//线段树
struct Node
{
    int l,r;
    int Max;
}segTree[MAXN*];
void build(int i,int l,int r)
{
    segTree[i].l = l;
    segTree[i].r = r;
    segTree[i].Max = ;
    if(l == r)return;
    int mid = (l+r)/;
    build(i<<,l,mid);
    build((i<<)|,mid+,r);
}
void push_up(int i)
{
    segTree[i].Max = max(segTree[i<<].Max,segTree[(i<<)|].Max);
}
void update(int i,int k,int val) // 更新线段树的第k个值为val
{
    if(segTree[i].l == k && segTree[i].r == k)
    {
        segTree[i].Max = val;
        return;
    }
    int mid = (segTree[i].l + segTree[i].r)/;
    if(k <= mid)update(i<<,k,val);
    else update((i<<)|,k,val);
    push_up(i);
}
int query(int i,int l,int r)  //查询线段树中[l,r] 的最大值
{
    if(segTree[i].l == l && segTree[i].r == r)
        return segTree[i].Max;
    int mid = (segTree[i].l + segTree[i].r)/;
    if(r <= mid)return query(i<<,l,r);
    else if(l > mid)return query((i<<)|,l,r);
    else return max(query(i<<,l,mid),query((i<<)|,mid+,r));
}
int find(int u,int v)//查询u->v边的最大值
{
    int f1 = top[u], f2 = top[v];
    int tmp = ;
    while(f1 != f2)
    {
        if(deep[f1] < deep[f2])
        {
            swap(f1,f2);
            swap(u,v);
        }
        tmp = max(tmp,query(,p[f1],p[u]));
        u = fa[f1]; f1 = top[u];
    }
    if(u == v)return tmp;
    if(deep[u] > deep[v]) swap(u,v);
    return max(tmp,query(,p[son[u]],p[v]));
}
int e[MAXN][];
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T;
    int n;
    scanf("%d",&T);
    while(T--)
    {
        init();
        scanf("%d",&n);
        for(int i = ;i < n-;i++)
        {
            scanf("%d%d%d",&e[i][],&e[i][],&e[i][]);
            addedge(e[i][],e[i][]);
            addedge(e[i][],e[i][]);
        }
        dfs1(,,);
        getpos(,);
        build(,,pos-);
        for(int i = ;i < n-; i++)
        {
            if(deep[e[i][]] > deep[e[i][]])
                swap(e[i][],e[i][]);
            update(,p[e[i][]],e[i][]);
        }
        char op[];
        int u,v;
        while(scanf("%s",op) == )
        {
            if(op[] == 'D')break;
            scanf("%d%d",&u,&v);
            if(op[] == 'Q')
                printf("%d\n",find(u,v));
            else update(,p[e[u-][]],v);
        }
    }
    return ;
}