codeforces-832D-LCA,RMQ

题目大意：问一棵树上取三个点，可以任选一点为w，求u，v到w两条路径所重合的顶点数；

题目解析：在线LCA；

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
const int N = 100010;
const int M = 25;
int dp[2*N][M];  //这个数组记得开到2*N，因为遍历后序列长度为2*n-1
bool vis[N];
struct edge
{
    int u,v,w,next;
}e[2*N];
int tot,head[N];
inline void add(int u ,int v ,int w ,int &k)
{
    e[k].u = u; e[k].v = v; e[k].w = w;
    e[k].next = head[u]; head[u] = k++;
    u = u^v; v = u^v; u = u^v;
    e[k].u = u; e[k].v = v; e[k].w = w;
    e[k].next = head[u]; head[u] = k++;
}
int ver[2*N],R[2*N],first[N],dir[N];
void dfs(int u ,int dep)
{
    vis[u] = true; ver[++tot] = u; first[u] = tot; R[tot] = dep;
    for(int k=head[u]; k!=-1; k=e[k].next)
        if( !vis[e[k].v] )
        {
            int v = e[k].v , w = e[k].w;
            dir[v] = dir[u] + w;
            dfs(v,dep+1);
            ver[++tot] = u; R[tot] = dep;
        }
}
void ST(int n)
{
    for(int i=1;i<=n;i++)
        dp[i][0] = i;
    for(int j=1;(1<<j)<=n;j++)
    {
        for(int i=1;i+(1<<j)-1<=n;i++)
        {
            int a = dp[i][j-1] , b = dp[i+(1<<(j-1))][j-1];
            dp[i][j] = R[a]<R[b]?a:b;
        }
    }
}
int RMQ(int l,int r)
{
    int k=0;
    while((1<<(k+1))<=r-l+1)
        k++;
    int a = dp[l][k], b = dp[r-(1<<k)+1][k]; 
    return R[a]<R[b]?a:b;
}

int LCA(int u ,int v)
{
    int x = first[u] , y = first[v];
    if(x > y) swap(x,y);
    int res = RMQ(x,y);
    return ver[res];
}
int ans;
int get(int a,int b)
{
	int r=LCA(a,b);
	return dir[a]+dir[b]-2*dir[r];	
}
void fun(int a,int b,int c)
{
	int temp=get(a,c)+get(b,c)-get(a,b);
	temp/=2;
	temp+=1;
	ans=max(ans,temp);
}

int main()
{
        int n,q,num = 0;
        scanf("%d%d",&n,&q);
        memset(head,-1,sizeof(head));
        memset(vis,false,sizeof(vis));
        for(int i=2; i<=n; i++)
        {
            int u,v,w;
            scanf("%d",&u);
            add(u,i,1,num);
        }
        tot = 0; dir[1] = 0;
        dfs(1,1);
        ST(2*n-1);
        while(q--)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            ans=1;
            fun(u,v,w);
            //fun(v,u,w);
            fun(u,w,v);

            fun(w,v,u);
            printf("%d\n",ans);
        }
    return 0;
}