POJ 2763 Housewife Wind 树链剖分

题目：http://poj.org/problem?id=2763

题意：给定一棵树，给定当前所在的点，有两种操作：第一种是更新第i条边的权值，第二种是求从当前点到目标点的路径权值

思路：基本是裸题了。。。

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

typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 100010;
struct edge
{
    int to, next;
}g[N*2];
struct node
{
    int l, r, sum;
}s[N*4];
int dep[N], top[N], siz[N], id[N], fat[N], son[N], head[N];
int d[N][3], val[N];
int n, m, k, num, cnt;
void add_edge(int v, int u)
{
    g[cnt].to = u;
    g[cnt].next = head[v];
    head[v] = cnt++;
}
void dfs1(int v, int fa, int d)
{
    dep[v] = d, siz[v] = 1, fat[v] = fa, son[v] = 0;
    for(int i = head[v]; i != -1; i = g[i].next)
    {
        int u = g[i].to;
        if(u != fa)
        {
            dfs1(u, v, d + 1);
            siz[v] += siz[u];
            if(siz[son[v]] < siz[u]) son[v] = u;
        }
    }
}
void dfs2(int v, int tp)
{
    top[v] = tp, id[v] = ++num;
    if(son[v]) dfs2(son[v], tp);
    for(int i = head[v]; i != -1; i = g[i].next)
    {
        int u = g[i].to;
        if(u != fat[v] && u != son[v]) dfs2(u, u);
    }
}
void push_up(int k)
{
    s[k].sum = s[k<<1].sum + s[k<<1|1].sum;
}
void build(int l, int r, int k)
{
    s[k].l = l, s[k].r = r;
    if(l == r)
    {
        s[k].sum = val[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, k << 1);
    build(mid + 1, r, k << 1|1);
    push_up(k);
}
void update(int x, int c, int k)
{
    if(s[k].l == s[k].r)
    {
        s[k].sum = c;
        return;
    }
    int mid = (s[k].l + s[k].r) >> 1;
    if(x <= mid) update(x, c, k << 1);
    else update(x, c, k << 1|1);
    push_up(k);
}
int query(int l, int r, int k)
{
    if(l <= s[k].l && s[k].r <= r)
        return s[k].sum;
    int mid = (s[k].l + s[k].r) >> 1;
    int ans = 0;
    if(l <= mid) ans += query(l, r, k << 1);
    if(r > mid) ans +=query(l, r, k << 1|1);
    return ans;
}
int seek(int v, int u)
{
    int t1 = top[v], t2 = top[u], ans = 0;
    while(t1 != t2)
    {
        if(dep[t1] < dep[t2])
            swap(t1, t2), swap(v, u);
        ans += query(id[t1], id[v], 1);
        v = fat[t1], t1 = top[v];
    }
    if(v == u) return ans;
    if(dep[v] > dep[u]) swap(v, u);
    return ans + query(id[son[v]], id[u], 1);
}
void slove()
{
    int a, b, c;
    while(k--)
    {
        scanf("%d", &a);
        if(a == 0)
        {
            scanf("%d", &b);
            printf("%d\n", seek(m, b));
            m = b; /*更新当前点*/
        }
        else
        {
            scanf("%d%d", &b, &c);
            update(id[d[b][1]], c, 1);
        }
    }
}
int main()
{
    while(~ scanf("%d%d%d", &n, &k, &m))
    {
        memset(head, -1, sizeof head);
        cnt = num = 0;
        for(int i = 1; i <= n - 1; i++)
        {
            scanf("%d%d%d", &d[i][0], &d[i][1], &d[i][2]);
            add_edge(d[i][0], d[i][1]);
            add_edge(d[i][1], d[i][0]);
        }
        dfs1(1, 0, 1);
        dfs2(1, 1);
        for(int i = 1; i <= n - 1; i++)
        {
            if(dep[d[i][0]] > dep[d[i][1]]) swap(d[i][0], d[i][1]);
            val[id[d[i][1]]] = d[i][2];
        }
        build(1, num, 1);
        slove();
    }
    return 0;
}