poj 2763（在线LCA+树状数组）

Housewife Wind

After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village lived in beautiful huts. There are some pairs of huts connected by bidirectional roads. We say that huts in the same pair directly connected. XX Village is so special that we can reach any other huts starting from an arbitrary hut. If each road cannot be walked along twice, then the route between every pair is unique.

Since Jiajia earned enough money, Wind became a housewife.
Their children loved to go to other kids, then make a simple call to
Wind: 'Mummy, take me home!'

At different times, the time needed to walk along a road may
be different. For example, Wind takes 5 minutes on a road normally, but
may take 10 minutes if there is a lovely little dog to play with, or
take 3 minutes if there is some unknown strange smell surrounding the
road.

Wind loves her children, so she would like to tell her children the exact time she will spend on the roads. Can you help her?

Input

The first line contains three integers n, q, s. There are n huts
in XX Village, q messages to process, and Wind is currently in hut s. n
< 100001 , q < 100001.

The following n-1 lines each contains three integers a, b and
w. That means there is a road directly connecting hut a and b, time
required is w. 1<=w<= 10000.

The following q lines each is one of the following two types:

Message A: 0 u

A kid in hut u calls Wind. She should go to hut u from her current position.

Message B: 1 i w

The time required for i-th road is changed to w. Note that
the time change will not happen when Wind is on her way. The changed can
only happen when Wind is staying somewhere, waiting to take the next
kid.

Output

For each message A, print an integer X, the time required to take the next child.

Sample Input

3 3 1
1 2 1
2 3 2
0 2
1 2 3
0 3

Sample Output

1
3

题意很简单 k为0时：求s到u的距离 k为1时 把第i条边的权值变为w
求a b两点的距离 用LCA 设d[i]为i到根节点的距离 l（a.b)=d[a]+d[b]-2*d[lca(a,b)];（很容易想到）
修改权值的话 我们用L[i],R[i]分别表示在DFS中第一次经过i节点的时间戳和回溯到该点的时间戳  
节点u到根节点的距离就是[0，L[u]]的和
对于更新每一条边时 DFS序较大的的节点为i 将l[i]的权值加上一个w R[i]+1的权值减去一个w 这样l{i]-R[i]区间内所有的顶点在求和的时候都加了w

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #include<map>
 #include<cstdlib>
 #include<vector>
 #include<set>
 #include<queue>
 #include<cstring>
 #include<string.h>
 #include<algorithm>
 typedef long long ll;
 typedef unsigned long long LL;
 using namespace std;
 const int N=+;
 int head[N];
 int cnt,n;
 int vis[N];
 int d[N],dp[N][];
 struct node{
     int to,next,w;
 }edge[*N];
 int t1,t2;
 int pos[N],dep[N],f[N],G[N];
 int w[N];
 int L[N],R[N];
 void init(){
     memset(vis,,sizeof(vis));
     cnt=;
     memset(head,-,sizeof(head));
     memset(pos,-,sizeof(pos));
     memset(d,,sizeof(d));
     t1=t2=;
 }
 void add(int u,int v,int w){
     edge[cnt].to=v;
     edge[cnt].w=w;
     edge[cnt].next=head[u];
     head[u]=cnt++;
 }
 int lowbit(int x){
     return x&-x;
 }
 void update(int x,int y){
     while(x<=n){
         d[x]=d[x]+y;
         x=x+lowbit(x);
     }
 }
 int sum(int x){
     int ans=;
     while(x){
         ans=ans+d[x];
         x=x-lowbit(x);
     }
     return ans;
 }
 void init_RMQ(int n){
     for(int i=;i<=n;i++)dp[i][]=i;
     for(int j=;(<<j)<=n;j++)
     for(int i=;i+(<<j)-<=n;i++)
     if(dep[dp[i][j-]]<dep[dp[i+(<<j-)][j-]])dp[i][j]=dp[i][j-];
     else
         dp[i][j]=dp[i+(<<j-)][j-];
         //dp[i][j]=min(dp[i][j-1],dp[i+(1<<j-1)][j-1]);
 }
 int RMQ(int l,int r){
     int k=;
     while((<<k+)<=r-l+)k++;
     if(dep[dp[l][k]]<dep[dp[r-(<<k)+][k]])return dp[l][k];
     else
         return dp[r-(<<k)+][k];
     //return min(dep[dp[l][k]],dep[dp[r-(1<<k)+1][k]]);
 }
 int lca(int u,int v){
     if(pos[u]>pos[v])return f[RMQ(pos[v],pos[u])];
     else
         return f[RMQ(pos[u],pos[v])];
 }
 void DFS(int x,int deep){
     f[t1]=x;
     dep[t1]=deep;
     pos[x]=t1++;
     L[x]=++t2;
     for(int i=head[x];i!=-;i=edge[i].next){
         //cout<<4<<endl;
         int v=edge[i].to;
         if(pos[v]==-){
             //cout<<3<<endl;
             G[edge[i].w]=v;
             DFS(v,deep+);
             f[t1]=x;
             dep[t1++]=deep;
         }

     }
     R[x]=t2;
 }
 int main(){
     int q,s;
     while(scanf("%d%d%d",&n,&q,&s)!=EOF){
         init();
         int u,v,W;
         for(int i=;i<n;i++){
             scanf("%d%d%d",&u,&v,&W);
             add(u,v,i);
             add(v,u,i);
             w[i]=W;
         }
         DFS(,);
         /*for(int i=1;i<=n;i++){
             cout<<L[i]<<" "<<R[i]<<endl;
         }
         cout<<endl;
         for(int i=1;i<=2*n-1;i++)cout<<f[i]<<" ";
         cout<<endl;*/
         init_RMQ(*n-);
         for(int i=;i<n;i++){
             update(L[G[i]],w[i]);
             update(R[G[i]]+,-w[i]);
         }
         u=s;
         while(q--){
             int k;
             scanf("%d",&k);
             if(k==){
                 scanf("%d%d",&u,&W);
                 update(L[G[u]],W-w[u]);
                 update(R[G[u]]+,-W+w[u]);
                 w[u]=W;
             }
             else{
                 scanf("%d",&v);
                 printf("%d\n",sum(L[s])+sum(L[v])-*sum(L[lca(s,v)]));
                 s=v;
             }
         }
     }
     return ;
 }