P4114 Qtree1

https://www.luogu.org/problemnew/show/P4114 

/*#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>*/
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------



//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------




const int maxn=1e5+9;
const int mod=1e9+7;

struct E
{
    int to,nex;
    int cost;
}edge[maxn*4];

struct node
{
    int val;
}tree[maxn<<2];

int n;
int head[maxn];
int tot;
int rk[maxn],fa[maxn],d[maxn],siz[maxn],son[maxn],top[maxn],id[maxn];
int cnt;
int val[maxn];

void addedge(int u,int v,int w)
{
    edge[tot].to=v;
    edge[tot].nex=head[u];
    edge[tot].cost=w;
    head[u]=tot++;
}
void dfs1(int u)
{
    d[u]=d[fa[u]]+1;
    siz[u]=1;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v==fa[u]) continue;
        fa[v]=u;
        val[v]=edge[i].cost;
        dfs1(v);
        siz[u]+=siz[v];
        if(siz[v]>siz[son[u]])
            son[u]=v;
    }
}
void dfs2(int u,int tp)
{
    top[u]=tp;
    id[u]=++cnt;
    rk[cnt]=u;
    if(!son[u]) return ;
    dfs2(son[u],tp);
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v!=son[u]&&v!=fa[u])
            dfs2(v,v);
    }
}


void pushup(int rt)
{
    tree[rt].val=max(tree[rt<<1].val,tree[rt<<1|1].val);
}

void build(int rt,int l,int r)
{
    if(l==r)
    {
        tree[rt].val=val[rk[l]];
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt);
}
void update(int rt,int l,int r,int ql,int qr,int val)
{
    if(l==r)
    {
        //cout<<l<<endl;
        tree[rt].val=val;
        return ;
    }
    int mid=(l+r)>>1;
    if(ql<=mid) update(rt<<1,l,mid,ql,qr,val);
    if(qr>mid) update(rt<<1|1,mid+1,r,ql,qr,val);
    pushup(rt);
}

int query(int rt,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r)
    {
        return tree[rt].val;
    }
    int ans=0;
    int mid=(l+r)>>1;
    if(ql<=mid) ans=max(ans,query(rt<<1,l,mid,ql,qr));
    if(qr>mid) ans=max(ans,query(rt<<1|1,mid+1,r,ql,qr));
    return ans;
}
int query_line(int x,int y)
{
    int ans=0;
    int tx=top[x];
    int ty=top[y];
    while(tx!=ty)
    {
        if(d[tx]>d[ty])swap(x,y),swap(tx,ty);
        ans=max(ans,query(1,1,n,id[ty],id[y]));
        y=fa[ty];
        ty=top[y];
    }
    if(d[x]>d[y])swap(x,y);
    ans=max(ans,query(1,1,n,id[x]+1,id[y]));
    return ans;
}

void init()
{
    tot=0;
    mem(head,-1);
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    sfi(n);

    init();

    for(int i=1;i<n;i++)
    {
        int uu,vv;
        int ww;
        scanf("%d%d%d",&uu,&vv,&ww);
        addedge(uu,vv,ww);
        addedge(vv,uu,ww);
    }
    cnt=0;
    dfs1(1);
    dfs2(1,1);
    build(1,1,n);
    while(1)
    {
        char op[10];
        sfs(op);
        int x,y;
        int z;
        if(op[0]=='C')
        {
            scanf("%d%d",&x,&z);
            int ide=x*2-1;
            int idee=ide-1;
            //cout<<ide<<" "<<idee<<endl;
            if(d[edge[ide].to]<d[edge[idee].to]) swap(ide,idee);
            update(1,1,n,id[edge[ide].to],id[edge[ide].to],z);
        }
        else if(op[0]=='Q')
        {

            scanf("%d%d",&x,&y);
            if(x==y) puts("0");
            else
                printf("%d\n",query_line(x,y));

        }
        else break;

    }


    return 0;
}