HDU 3078

就是求最近公共祖先  点击打开链接 Q

#include<stdio.h>
#include<string.h>
#include<stack>
#include<string>
#include<math.h>
#include<queue>
#include<set>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
#define LL long long
#define inf 199999999
#define N 80010
int ans[N],deep[N],pre[N],val[N];
bool vis[N];
int n,m,k,cnt;
vector<int>edge[N];
void dfs(int u,int depth)
{
    vis[u]=1;deep[u]=depth;
    for(int i=0;i<edge[u].size();i++)
    {
        int v=edge[u][i];
        if(vis[v]) continue;
        pre[v]=u;
        dfs(v,depth+1);
    }
}
void Lca(int u,int v)
{
    while(deep[u]>deep[v])
    {
        ans[++cnt]=val[u];
        u=pre[u];
    }
    while(deep[v]>deep[u])
    {
        ans[++cnt]=val[v];
        v=pre[v];
    }
    while(u!=v)
    {
        ans[++cnt]=val[u];
        ans[++cnt]=val[v];
        u=pre[u];v=pre[v];
    }
    ans[++cnt]=val[u];
}
int main()
{
    int i,j,u,v;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++) edge[i].clear();
    for(i=1;i<=n;i++) scanf("%d",&val[i]);
    for(i=1;i<n;i++)
    {
        scanf("%d%d",&u,&v);
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    memset(vis,0,sizeof(vis));
    deep[1]=0;pre[1]=1;
    dfs(1,0);
    while(m--)
    {
        scanf("%d%d%d",&k,&u,&v);
        if(k==0){ val[u]=v;continue;}
        cnt=0; Lca(u,v);
        if(cnt<k)printf("invalid request!\n");
        else
        {
            sort(ans+1,ans+1+cnt);
            printf("%d\n",ans[cnt-k+1]);
        }
    }
    return 0;
}