FZU2082（树链剖分边操作）

题比较简单，直接粘代码吧

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int maxn = 100000 + 10;
typedef long long ll;
#define clr(x,y) memset(x,y,sizeof x)
#define INF 0x3f3f3f3f
const ll Mod = 1e9 + 7;
typedef pair<int,int> P;


struct Edge{int to,next;}edge[maxn << 2];
int head[maxn],edge_num;
int num,dep[maxn],id[maxn],siz[maxn],son[maxn],fa[maxn];
void Init()
{
    clr(head,-1);edge_num = 0;num = 0;
}
void add_edge(int x,int y)
{
    edge[edge_num] = (Edge){y,head[x]};head[x] = edge_num ++;
}
void dfs1(int u,int pre,int d)
{
    dep[u] = d;fa[u] = pre;siz[u] = 1;son[u] = 0;
    for(int i = head[u];i != -1;i = edge[i].next)
    {
        int v = edge[i].to;
        if(v == pre)continue;
        dfs1(v,u,d + 1);
        siz[u] += siz[v];
        if(son[u] == 0 || siz[v] > siz[son[u]])
            son[u] = v;
    }
}
int top[maxn];
void dfs2(int u,int tp)
{
    top[u] = tp;id[u] = ++ num;
    if(son[u])
        dfs2(son[u],tp);
    for(int i = head[u];i != -1;i = edge[i].next)
    {
        int v = edge[i].to;

        if(v != son[u] && v != fa[u])
            dfs2(v,v);
    }
}
int U[maxn],V[maxn],val[maxn];


ll tree[maxn << 2];

void update(int pos,int x,int l,int r,int rt)
{
    if(l == r){tree[rt] = x;return;}
    int mid = (l + r) >> 1;
    if(pos <= mid)update(pos,x,l,mid,rt << 1);
    if(pos >= mid + 1)update(pos,x,mid + 1,r,rt << 1|1);
    tree[rt] = tree[rt << 1] + tree[rt << 1|1];
}
ll query(int L,int R,int l,int r,int rt)
{
    if(L <= l &&  R >= r)return tree[rt];
    int mid = (l + r) >> 1;
    ll ret = 0;
    if(L <= mid)
        ret += query(L,R,l,mid,rt << 1);
    if(R >= mid + 1)
        ret += query(L,R,mid + 1,r,rt << 1|1);
    return ret;
}
ll solve(int u,int v)
{
    int f1 = top[u],f2 = top[v];ll ret = 0;
    while(f1 != f2)
    {
        if(dep[f1] < dep[f2]){swap(u,v);swap(f1,f2);}
        ret += query(id[f1],id[u],2,num,1);
        u = fa[f1];f1 = top[u];
    }
    if(dep[u] > dep[v])swap(u,v);
    if(u != v)
        ret += query(id[son[u]],id[v],2,num,1);
    return ret;
}
int main()
{
    int n,m;
    while( ~ scanf("%d%d",&n,&m))
    {
        Init();
        for(int i = 1;i <= n - 1;i ++)
        {
            int x,y,z;scanf("%d%d%d",&x,&y,&z);
            add_edge(x,y);add_edge(y,x);
            U[i] = x;V[i] = y;val[i] = z;
        }
        dfs1(1,1,1);dfs2(1,1);

        for(int i = 1;i <= n - 1;i ++)
        {
            int x = U[i],y = V[i],z = val[i];
            if(dep[x] < dep[y])swap(U[i],V[i]),swap(x,y);
            update(id[x],z,2,num,1);
        }

        while(m --)
        {
            int x,y,z;scanf("%d%d%d",&x,&y,&z);
            if(x == 0)
            {
                update(id[U[y]],z,2,num,1);
            }
            else
            {
                printf("%lld\n",solve(y,z));
            }
        }
    }
    return 0;
}