树链剖分入门 poj 2763

题目链接：题目

修改边权，查询两点间距离，树链剖分，按边权建树，线段树维护即可。

代码：

/* ***********************************************
Author :xianxingwuguan
Created Time :2014/1/15 21:27:00
File Name :4.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
const int maxn=100100;
struct EDGE 
{
      int next,to;
}edge[3*maxn];
int head[maxn],to,top[maxn],fa[maxn],deep[maxn],num[maxn],p[maxn],fp[maxn],tol,pos,son[maxn];
void init()
{
      memset(head,-1,sizeof(head));
      tol=0;
      memset(son,-1,sizeof(head));
      pos=0;
}
void add(int u,int v)
{
      edge[tol].to=v;
      edge[tol].next=head[u];
      head[u]=tol++;
}
void dfs1(int u,int pre,int d)
{
      deep[u]=d;
      fa[u]=pre;
      num[u]=1;
      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);
	     num[u]+=num[v];
	     if(son[u]==-1||num[v]>num[son[u]])son[u]=v;
      }
}
void getpos(int u,int sp)
{
      top[u]=sp;
      p[u]=pos++;
      fp[p[u]]=u;
      if(son[u]==-1)return;
      getpos(son[u],sp);
      for(int i=head[u];i!=-1;i=edge[i].next)
      {
	     int v=edge[i].to;
	     if(v!=son[u]&&v!=fa[u])
		    getpos(v,v);
      }
}
struct NODE 
{
      int l,r,sum;
}tree[4*maxn];
void build(int i,int l,int r)
{
      tree[i].l=l;
      tree[i].r=r;
      tree[i].sum=0;
      if(l==r)return;
      int mid=(l+r)>>1;
      build(2*i,l,mid);
      build(2*i+1,mid+1,r);
}
void pushup(int i)
{
      tree[i].sum=tree[2*i].sum+tree[2*i+1].sum;
}
void update(int i,int k,int val)
{
      if(tree[i].l==tree[i].r)
      {
	     tree[i].sum=val;
	     return;
      }
      int mid=(tree[i].l+tree[i].r)>>1;
      if(k<=mid)update(2*i,k,val);
      else update(2*i+1,k,val);
      pushup(i);
}
int query(int i,int l,int r)
{
      if(tree[i].l>=l&&tree[i].r<=r)return tree[i].sum;
      int mid=(tree[i].l+tree[i].r)>>1;
      int ans=0;
      if(l<=mid)ans+= query(2*i,l,r);
      if(r>mid)ans+= query(2*i+1,l,r);
      return ans;
}
int find(int u,int v)
{
      int f1=top[u],f2=top[v];
      int ans=0;
      while(f1!=f2)
      {
	     if(deep[f1]<deep[f2])
	     {
		    swap(f1,f2);
		    swap(u,v);
	     }
	     ans+=query(1,p[f1],p[u]);
	     u=fa[f1];
	     f1=top[u];
      }
      if(u==v)return ans;
      if(deep[u]>deep[v])swap(u,v);
      return ans+query(1,p[son[u]],p[v]);
}
int e[maxn][3];
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,Q,s,t;
    while(~scanf("%d%d%d",&n,&Q,&s))
    {
        init();
        for(int i = 0;i < n-1;i++)
        {
            scanf("%d%d%d",&e[i][0],&e[i][1],&e[i][2]);
            add(e[i][0],e[i][1]);
            add(e[i][1],e[i][0]);
        }
        dfs1(1,0,0);
        getpos(1,1);
        build(1,0,pos-1);
        for(int i = 0;i < n-1; i++)
        {
            if(deep[e[i][0]] > deep[e[i][1]])
                swap(e[i][0],e[i][1]);
            update(1,p[e[i][1]],e[i][2]);
        }
        int u,v;
        while(Q--)
        {
	     int op;
            scanf("%d",&op);
	     if(op==0)
	     {
		    scanf("%d",&t);
		    printf("%d\n",find(s,t));
		    s=t;
	     }
	     else 
	     {
		    scanf("%d%d",&u,&v);
                  update(1,p[e[u-1][1]],v);
	     }
        }
    }
    return 0;
}