【bzoj1602】牧场行走 lca

AC通道：http://www.lydsy.com/JudgeOnline/problem.php?id=1602 

【题解】

dis(x,y)=dis(x,1)+dis(y,1)-2*dis( lca(x,y) , 1)

很水的题。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<algorithm>
using namespace std;
#define MAXN 1010
struct node{int y,next,v;}e[MAXN*2];
int n,m,len,Link[MAXN],f[MAXN],deep[MAXN],dis[MAXN],anc[MAXN][25];
inline int read()
{
    int x=0,f=1;  char ch=getchar();
    while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getchar();}
    while(isdigit(ch))  {x=x*10+ch-'0';  ch=getchar();}
    return x*f;
}
void insert(int x,int y,int v)  {e[++len].next=Link[x];Link[x]=len;e[len].y=y;e[len].v=v;}
void dfs(int x,int fa)
{
    anc[x][0]=f[x];
    for(int i=1;i<=20;i++)  anc[x][i]=anc[anc[x][i-1]][i-1];
    for(int i=Link[x];i;i=e[i].next)
        if(e[i].y!=fa)
        {
            deep[e[i].y]=deep[x]+1;
            dis[e[i].y]=dis[x]+e[i].v;
            f[e[i].y]=x;
            dfs(e[i].y,x);
        }
}
int lca(int x,int y)
{
    if(deep[x]<deep[y])  swap(x,y);
    for(int i=20;i>=0;i--)
        if(deep[anc[x][i]]>=deep[y])  x=anc[x][i];
    if(x==y)  return x;
    for(int i=20;i>=0;i--)
        if(anc[x][i]!=anc[y][i])  x=anc[x][i],y=anc[y][i];
    return f[x];
}
int main()
{
    //freopen("cin.in","r",stdin);
    //freopen("cout.out","w",stdout);
    n=read();  m=read();
    for(int i=1;i<n;i++)  {int x=read(),y=read(),v=read();  insert(x,y,v);  insert(y,x,v);}
    deep[1]=1;  dfs(1,0);
    for(int i=1;i<=m;i++)
    {
        int x=read(),y=read();
        printf("%d\n",dis[x]+dis[y]-2*dis[lca(x,y)]);
    }
    return 0;
}