poj 2763树上LCA RMQ 树状数组维护

注意把第i条边 修改 i-- e[i*2].u 是一个小技巧
sum 和add 和普通树状数组 模板有一个小差异 因为是修改对子树有影响 也就是节点更大的点有影响 所以sum向上加

#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include<iostream>
using namespace std;

const int maxn = 2e5+100;

int N,Q,S;

struct edge
{
    int to,next,w;
} e[2*maxn];

int head[2*maxn],tot;
void add_edge(int u,int v,int w)
{
    e[tot].to = v;
    e[tot].w = w;
    e[tot].next = head[u];
    head[u] = tot++;

    e[tot].to = u;
    e[tot].w = w;
    e[tot].next = head[v];
    head[v] = tot++;
}
int in[maxn],out[maxn],P[2*maxn],fa[maxn][30],dep[maxn],dis[maxn],cnt;
void dfs(int u,int _fa,int _dep,int _dis)
{
    in[u] = ++cnt;
    P[cnt] = u;
    fa[u][0] = _fa;
    dis[u] = _dis;
    dep[u] = _dep;
    for(int i=head[u]; ~i; i=e[i].next)
    {
        int v = e[i].to;
        if(v == _fa)
            continue;
        dfs(v,u,_dep+1,_dis+e[i].w);
    }
    out[u] = cnt;
}
int initLCA()
{
    int m = (int)log(N)/log(2)+1;
    for(int k=0; k<=m; k++)
    {
        for(int v=1; v<=N; v++)
        {
            if(fa[v][k] < 0)
            {
                fa[v][k+1] = -1;
                continue;
            }
            else
                fa[v][k+1] = fa[fa[v][k]][k];
        }
    }
}
int LCA(int u,int v)
{
    int m = (int)log(N)/log(2)+1;
    if(dep[v] > dep[u])
        swap(u,v);
    for(int k=0; k<=m; k++)
    {
        if((dep[u]-dep[v])>>k & 1 )
            u = fa[u][k];
    }
    if(u == v)
        return u;
    for(int k=m; k>=0; k--)
    {
        if(fa[u][k] != fa[v][k])
        {
            u = fa[u][k];
            v = fa[v][k];
        }
    }
    return fa[u][0];
}

int c[2*maxn];
int lowbit(int x)
{
    return x&-x;
}

void init()
{
    memset(head,-1,sizeof head);
    memset(fa,-1,sizeof fa);
    memset(c,0,sizeof c);
    memset(in,0,sizeof in);
    memset(out,0,sizeof out);
    tot = 0;
    cnt = 0;
}

void add(int x,int d)
{
    while(x)
    {
        c[x] += d;
        x -= lowbit(x);
    }
}
void add_seg(int l,int r,int d)
{
    add(r,d);
    add(l-1,-d);



}
int sum(int x)
{
    int res = 0;
    while(x <= cnt)
    {
        res += c[x];
        x += lowbit(x);
    }
    return res;
}
int dist(int x)
{
    if(x == -1)
        return 0;
    return sum(in[x]) + dis[x];
}
int main()
{
    while(~scanf("%d%d%d",&N,&Q,&S))
    {
        init();
        for(int i=0,u,v,w; i<N-1; i++)
        {
            scanf("%d%d%d",&u,&v,&w);
            add_edge(u,v,w);
        }
        dfs(1,-1,1,0);
        initLCA();
         for(int i=0; i<tot; i+=2)
        {
            if(dep[e[i].to] < dep[e[i+1].to])
                swap(e[i].to,e[i+1].to);
        }
        int op;
        for(int i=0,a,b,c; i<Q; i++)
        {
            scanf("%d",&op);
            if(op == 0)
            {
                scanf("%d",&a);
                int lca = LCA(S,a);

                printf("%d\n",dist(S)+dist(a)-2*(dist(lca)));
                S = a;
            }
            else
            {
                scanf("%d%d",&a,&b);
                a--;
                int u = e[a*2].to;
                int dw = b - (dist(u) - dist(fa[u][0]));
                add_seg(in[u],out[u],dw);
                cout<<"dw"<<dw<<endl;
                cout<<in[u]<<" "<<out[u]<<endl;

            }
        }
    }
}